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.
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Quantitative solution of omega-regular games380872
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Partial correctness for probabilistic demonic programs
Theoretical Computer Science
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
Theoretical Computer Science
Games, Probability, and the Quantitative µ-Calculus qMµ
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Fully Abstract Characterization of Probabilistic May Testing
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
Model checking discounted temporal properties
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Probabilistic guarded commands mechanized in HOL
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
Proofs of randomized algorithms in Coq
Science of Computer Programming
Probabilistic Guarded Commands Mechanized in HOL
Electronic Notes in Theoretical Computer Science (ENTCS)
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Probabilistic termination in B
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Reputation-based decisions for logic-based cognitive agents
Autonomous Agents and Multi-Agent Systems
Compositional specification and analysis of cost-based properties in probabilistic programs
FM'05 Proceedings of the 2005 international conference on Formal Methods
Proofs of randomized algorithms in CoQ
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Proof rules for probabilistic loops
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on 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 |
In this paper we give a probabilistic analog PPDL of Propositional Dynamic Logic. We prove a small model property and give a polynomial space decision procedure for formulas involving well-structured programs. We also give a deductive calculus and illustrate its use by calculating the expected running time of a simple random walk program.