Probabilistic predicate transformers
- 1 May 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 18 (3) , 325-353
- https://doi.org/10.1145/229542.229547
Abstract
Probabilistic predicates generalize standard predicates over a state space; with probabilistic predicate transformers one thus reasons about imperative programs in terms of probabilistic pre- and postconditions. Probabilistic healthiness conditions generalize the standard ones, characterizing “real” probabilistic programs, and are based on a connection with an underlying relational model for probabilistic execution; in both contexts demonic nondeterminism coexists with probabilistic choice. With the healthiness conditions, the associated weakest-precondition calculus seems suitable for exploring the rigorous derivation of small probabilistic programs.Keywords
This publication has 12 references indexed in Scilit:
- Data refinement of predicate transformersTheoretical Computer Science, 1991
- Duality in specification languages: a lattice-theoretical approachActa Informatica, 1990
- A logic for reasoning about probabilitiesInformation and Computation, 1990
- A generalization of Dijkstra's calculusACM Transactions on Programming Languages and Systems, 1989
- The specification statementACM Transactions on Programming Languages and Systems, 1988
- A theoretical basis for stepwise refinement and the programming calculusScience of Computer Programming, 1987
- Termination of Probabilistic Concurrent ProgramACM Transactions on Programming Languages and Systems, 1983
- The choice coordination problemActa Informatica, 1982
- Semantics of probabilistic programsJournal of Computer and System Sciences, 1981
- An axiomatic basis for computer programmingCommunications of the ACM, 1969