Probabilistic guarded commands mechanized in HOL

Theoretical Computer Science

Volumn 346, Issue 1, 2005, Pages 96-112

  Hurd, Joe ^a   McIver, Annabelle ^b   Morgan, Carroll ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b MACQUARIE UNIVERSITY   (Australia)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Formal verification; pGCL; Probabilistic programs

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; SEMANTICS; THEOREM PROVING;

FORMAL VERIFICATION; PGCL; PROBABILISTIC PROGRAMS;

PROBABILISTIC LOGICS;

EID: 27744471200     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.08.005     Document Type: Conference Paper

References (17)

1. E.W. Dijkstra A Discipline of Programming 1976 Prentice-Hall Englewood Cliffs, NJ
2. M.J.C. Gordon Mechanizing programming logics in higher order logic G. Birtwistle P.A. Subrahmanyam Current Trends in Hardware Verification and Automated Theorem Proving 1989 Springer Berlin 387 439
3. M.J.C. Gordon, and T.F. Melham Introduction to HOL (A theorem-proving environment for higher order logic) 1993 Cambridge University Press Cambridge
4. M. Gordon, R. Milner, C. Wadsworth, Edinburgh LCF, Lecture Notes in Computer Science, Vol. 78, Springer, Berlin, 1979.
5. J. Harrison, Formalizing Dijkstra, in: J. Grundy, M. Newey (Eds.), Theorem Proving in Higher Order Logics, 11th Internat. Conf., TPHOLs '98, Lecture Notes in Computer Science, Vol. 1497, Canberra, Australia, Springer, Berlin, September 1998, pp. 171-188.
6. T.S. Hoang, Z. Jin, K. Robinsion, A.K. McIver, C.C. Morgan, Probabilistic invariants for probabilistic machines, in: Proc. third Internat. Conf. of B and Z Users 2003, Lecture Notes in Computer Science, Vol. 2651, Springer, Berlin, pp. 240-159.
7. J. Hurd, Formal verification of probabilistic algorithms, Ph.D. Thesis, University of Cambridge, 2002.
8. M. Huth, The interval domain: a matchmaker for aCTL and aPCTL, in: R. Cleaveland, M. Mislove, P. Mulry (Eds.), US-Brazil Joint Workshops on the Formal Foundations of Software Systems, Electronic Notes in Theoretical Computer Science, Vol. 14, Elsevier, Amsterdam, 2000.
9. D. Kozen. A probabilistic PDL, Proc. 15th ACM Symp. on Theory of Computing, 1983.
10. E. Kushilevitz, M.O. Rabin, Randomized mutual exclusion algorithms revisited, in: M. Herlihy (Ed.), Proc. 11th Ann. Symp. on Principles of Distributed Computing, Vancouver, BC, Canada, ACM Press, New york, August 1992, pp. 275-283.
11. M. Kwiatkowska, G. Norman, D. Parker, Prism: probabilistic symbolic model checker, in: Proc. of PAPM/PROBMIV 2001 Tools Session, September 2001.
12. A.K. McIver, and C.C. Morgan Partial correctness for probabilistic programs Theoret. Comput. Sci. 266 1-2 2001 513 541
13. C. Morgan, Proof rules for probabilistic loops, in: H. Jifeng, J. Cooke, P. Wallis (Eds.), Proc. BCS-FACS 7th Refinement Workshop, Workshops in Computing, Springer, Berlin, 1996.
14. C. Morgan, A. McIver, pGCL: formal reasoning for random algorithms, South African Comput. J. 22 (1999) 14-27.
15. C. Morgan, A. McIver, and K. Seidel Probabilistic predicate transformers ACM Trans. Programming Languages Systems 18 3 1996 325 353 See also [12]
16. T. Nipkow, Hoare logics in Isabelle/HOL, in: H. Schwichtenberg, R. Steinbrüggen (Eds.), Proof and System-Reliability, Kluwer, Dordrecht, 2002, pp. 341-367.
17. J. Shield, I.J. Hayes, and D.A. Carrington Using theory interpretation to mechanise the reals in a theorem prover C. Fidge Electronic Notes in Theoretical Computer Science Vol. 42 2001 Elsevier Amsterdam