Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
First-Order Dynamic Logic
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Logics for probabilistic programming (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
PROBABILISTIC ALGORITHM IN FINITE FIELDS
PROBABILISTIC ALGORITHM IN FINITE FIELDS
Formalizing the analysis of algorithms.
Formalizing the analysis of algorithms.
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A decidable propositional probabilistic dynamic logic
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of 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.02 |
A logic, Pr(DL), is presented, which enables reasoning about probabilistic programs or, alternatively, reasoning probabilistically about conventional programs. The syntax of Pr(DL) derives from Pratt's first-order dynamic logic and the semantics extends Kozen's semantics of probabilistic programs. An axiom system for Pr(DL) is presented and shown to be complete relative to an extension of first-order analysis. For discrete probabilities it is shown that first-order analysis actually suffices. Examples are presented, both of the expressive power of Pr(DL), and of a proof in the axiom system.