The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The Deducibility Problem in Propositional Dynamic Logic
Proceedings of the 8th Colloquium on Automata, Languages and Programming
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Logics for probabilistic programming (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Formalizing the analysis of algorithms.
Formalizing the analysis of algorithms.
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
A propositional version of Feldman and Harel's Pr (DL) is defined, and shown to be decidable. The logic allows propositional-level formulas involving probabilistic programs, and contains full real-number theory for dealing with probabilities. The decidability proof introduces model schemes, which seem to be the most basic structures relating programs and probabilities.