Probabilistic Predicate Transformers

ACM Transactions on Programming Languages and Systems

Volumn 18, Issue 3, 1996, Pages 325-353

  Morgan, Carroll ^a,b   McIver, Annabelle ^a,b   Seidel, Karen ^a,b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b Programming Research Group   (United Kingdom)

Author keywords

D.2.4 Program Verification : Correctness Proofs; D.3.1 Programming Languages : Formal Definitions and Theory; F.1.2 Modes of Computation : Probabilistic Computation

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; FORMAL LANGUAGES; PROBABILITY; PROGRAMMING THEORY; STATISTICS;

GALOIS CONNECTION; NONDETERMINISM; PREDICATE TRANSFORMERS; PROBABILISTIC COMPUTATION; PROGRAM DERIVATION; PROGRAM REASONING; PROGRAM VERIFICATION; REFINEMENT; WEAKEST PRECONDITIONS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0030143516     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/229542.229547     Document Type: Article

References (33)

1. BACK, R.-J. R. AND VON WRIGHT, J. 1990. Duality in specification languages: A lattice theoretical approach. Acta Inf. 27, 583-625.
2. CHANDY, K. M. AND MISRA, J. 1988. Parallel Program Design: A Foundation. Addison-Wesley, Reading, Mass.
3. DIJKSTRA, E. W. 1976. A Discipline of Programming. Prentice Hall International, Englewood Cliffs, N.J.
4. FAGIN, R., HALPERN, J. Y., AND MEGIDDO, N. 1990. A logic for reasoning about probabilities. Inf. Comput. 87, 78-128.
5. GARDINER, P. H. B. AND MORGAN, C. C. 1991. Data refinement of predicate transformers. Theor. Comput. Sci. 87, 143-162. Reprinted in On the Refinement Calculus, C.C. Morgan and T.N. Vickers, Eds. Springer-Verlag, Berlin, 1994.
6. GARDINER, P. H. B. AND MORGAN, C. C. 1991. Data refinement of predicate transformers. Theor. Comput. Sci. 87, 143-162. Reprinted in On the Refinement Calculus, C.C. Morgan and T.N. Vickers, Eds. Springer-Verlag, Berlin, 1994.
7. GRIMMETT, G. AND WELSH, D. 1986. Probability: An Introduction. Oxford Science Publications. Oxford University Press, Oxford.
8. HART, S., SHARIR, M., AND PNUELI, A. 1983. Termination of probabilistic concurrent programs. ACM Trans. Program. Lang. Syst. 5, 356-380.
9. HE, J., McIVER, A. K., AND SEIDEL, K. 1996. Probabilistic models for the guarded command language. Sci. Comput. Program. To appear in FMTA '95 special issue. Also available via http at http://www.comlab.ox.ac.uk/oucl/groups/probs/bibliography.html.
10. HE, J., McIVER, A. K., AND SEIDEL, K. 1996. Probabilistic models for the guarded command language. Sci. Comput. Program. To appear in FMTA '95 special issue. Also available via http at http://www.comlab.ox.ac.uk/oucl/groups/probs/bibliography.html.
11. HESSELINK, W. H. 1992. Programs, Recursion and Unbounded Choice. Cambridge Tracts in Theoretical Computer Science, vol. 27. Cambridge University Press, Cambridge, U.K.
12. HOARE, C. A. R. 1969. An axiomatic basis for computer programming. Commun. ACM 12, 10 (Oct.), 576-580, 583.
13. JONES, C. 1990. Probabilistic nondeterminism. Ph.D. thesis, Monograph ECS-LFCS-90-105, Edinburgh Univ. Edinburgh, U.K.
14. JONES, C. AND PLOTKIN, G. 1989. A probabilistic powerdomain of evaluations. In Proceedings of the IEEE 4th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 186-195.
15. KOZEN, D. 1981. Semantics of probabilistic programs. J. Comput. Syst. Sci. 22, 328-350.
16. KOZEN, D. 1983. A probabilistic PDL. In Proceedings of the 15th ACM Symposium on Theory of Computing. ACM, New York.
17. LEHMANN, D. AND RABIN, M. O. 1981. On the advantages of free choice: A symmetric and fully-distributed solution to the Dining Philosophers Problem. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 133-138.
18. LOWE, G. 1993. Representing nondeterministic and probabilistic behaviour in reactive processes. Programming Research Group, Oxford.
19. McIVER, A. K. AND MORGAN, C. C. 1996. Probabilistic predicate transformers: Part 2. Tech. Rep. PRG-TR-5-96, Programming Research Group, Oxford. Also available via http at http://www.comlab.ox.ac.uk/oucl/groups/probs/bibliography.html.
20. MORGAN, C. C. 1988. The specification statement. ACM Trans. Program. Lang. Syst. 10, 3 (July). Reprinted in On the Refinement Calculus, C.C. Morgan and T.N. Vickers, Eds. Springer-Verlag, Berlin, 1994.
21. MORGAN, C. C. 1988. The specification statement. ACM Trans. Program. Lang. Syst. 10, 3 (July). Reprinted in On the Refinement Calculus, C.C. Morgan and T.N. Vickers, Eds. Springer-Verlag, Berlin, 1994.
22. MORGAN, C. C. 1995. Proof rules for probabilistic loops. Tech. Rep. PRG-TR-25-95, Programming Research Group, Oxford. To appear in Proceedings of the 7th BCS FACS Refinement Workshop (July 1996), Springer-Verlag. Also available via http at http://www.comlab.ox.ac.uk/oucl/groups/probs/bibliography.html.
23. MORGAN, C. C. 1995. Proof rules for probabilistic loops. Tech. Rep. PRG-TR-25-95, Programming Research Group, Oxford. To appear in Proceedings of the 7th BCS FACS Refinement Workshop (July 1996), Springer-Verlag. Also available via http at http://www.comlab.ox.ac.uk/oucl/groups/probs/bibliography.html.
24. MORGAN, C. C., MCIVER, A. K., SEIDEL, K., AND SANDERS, J. W. 1994. Refinement-oriented probability for CSP. Tech. Rep. PRG-TR-12-94, Programming Research Group, Oxford. To appear in Formal Aspects of Computing. Also available via http at http://www.comlab.ox.ac.uk/oucl/groups/probs/bibliography.html.
25. MORGAN, C. C., MCIVER, A. K., SEIDEL, K., AND SANDERS, J. W. 1994. Refinement-oriented probability for CSP. Tech. Rep. PRG-TR-12-94, Programming Research Group, Oxford. To appear in Formal Aspects of Computing. Also available via http at http://www.comlab.ox.ac.uk/oucl/groups/probs/bibliography.html.
26. MORRIS, J. M. 1987. A theoretical basis for stepwise refinement and the programming calculus. Sci. Comput. Program. 9, 3 (Dec.), 287-306.
27. NELSON, G. 1989. A generalization of Dijkstra's calculus. ACM Trans, Program. Lang. Syst. 11, 4 (Oct.), 517-561.
28. RABIN, M. O. 1982. The choice-coordination problem. Acta Inf. 17, 2 (June), 121-134.
29. RAO, J. R. 1992. Building on the UNITY experience: Compositionality, fairness and probability in parallelism. Ph.D. thesis, Univ. of Texas at Austin, Austin, Tex.
30. RAO, J. R. 1994. Reasoning about probabilistic parallel programs. ACM Trans. Program. Lang. Syst. 16, 3 (May).
31. SCHRIJVER, A. 1986. Theory of Integer and Linear Programming. Wiley, New York.
32. SEIDEL, K., MORGAN, C. C., AND MCIVER, A. K. 1996. An introduction to probabilistic predicate transformers. Tech. Rep. PRG-TR-6-96, Programming Research Group, Oxford. Also available via http at http://www.comlab.ox.ac.uk/oucl/groups/probs/bibliography.html.
33. TRUSTRUM, K. 1971. Linear Programming. Library of Mathematics. Routledge and Kegan Paul, London.