Using probabilistic Kleene algebra pKA for protocol verification

Journal of Logic and Algebraic Programming

Volumn 76, Issue 1, 2008, Pages 90-111

  McIver, A K ^a   Gonzalia, C ^a   Cohen, E ^b   Morgan, C C ^c  

^a MACQUARIE UNIVERSITY   (Australia)

^b MICROSOFT   (United States)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Kleene algebra; Probabilistic systems; Probabilistic verification

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; SCHEDULING ALGORITHMS; VERIFICATION;

KLEENE ALGEBRA; PROBABILISTIC SYSTEMS; PROBABILISTIC VERIFICATION;

ALGEBRA;

EID: 43049179674     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2007.10.005     Document Type: Article

References (30)

1. KAT-ML project homepage. .
2. Kamal Aboul-Hosn, A proof-theoretic approach to mathematical knowledge management, Ph.D. thesis, Department of Computer Science, Cornell University, 2007.
3. Aboul-Hosn K., and Kozen D. KAT-ML: an interactive theorem prover for Kleene algebra with tests. J. Appl. Non-Classical Logics 1 (2006)
4. Back R.-J.R., and von Wright J. Refinement Calculus: A Systematic Introduction (1998), Springer-Verlag
5. O. Celiku, Mechanisation of dually anelgic and probabilistic programs, Ph.D. thesis, TUVCS, 2006.
6. Cohen E. Separation and reduction. Mathematics of Program Construction, 5th International Conference, July. LNCS vol. 1837 (2000), Springer-Verlag 45-59
7. Carlos Gonzalia, Computer formalised pKA proofs. .
8. Halpern J., and Tuttle M. Knowledge, probabilities and adversaries. JACM 40 4 (1993) 917-962
9. He J., Seidel K., and McIver A.K. Probabilistic models for the guarded command language. Sci. Comput. Programming 28 (1997) 171-192 Available at [19, key HSM95]
10. Hoang T.S., Morgan C.C., McIver A., Robinson K.A., and Jin Z.D. Refinement in probabilistic b: Foundation and case study. In: Treharne H., and Schneider S. (Eds). Proceedings of ZB 2005. LNCS vol. 3455 (2005), Springer 252-273
11. Hurd J. A formal approach to probabilistic termination. In: Carreño V.A., Muñoz C.A., and Tahar S. (Eds). 15th International Conference on Theorem Proving in Higher Order Logics: TPHOLs, Hampton, VA, August. LNCS vol. 2410 (2002), Springer 230-245. http://www.cl.cam.ac.uk/~jeh1004/research/papers www.cl.cam.ac.uk/~jeh1004/research/papers
12. Hurd J., McIver A.K., and Morgan C.C. Probabilistic guarded commands mechanised in HOL. Theor. Comput. Sci. (2005) 96-112
13. C. Jones, Probabilistic nondeterminism, Monograph ECS-LFCS-90-105, Ph.D. thesis, Edinburgh University, 1990.
14. Kozen D. Kleene algebra with tests. ACM Trans. Programming Lang. Syst. 19 3 (1997) 427-443
15. Eyal Kushilevitz, M.O. Rabin, Randomized mutual exclusion algorithms revisited, in: Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, 1992, pp. 275-283.
16. Lehmann D., and Shelah S. Reasoning with time and chance. Inform. and Control 53 3 (1982) 165-198
17. McIver A., Cohen E., and Morgan C. Using probabilistic Kleene algebra pKA for protocol verification. In: Struth G., and Schmidt R. (Eds). Proc the 9th International Conference on Relational Methods in Computer Science. LNCS vol. 4136 (2006), Springer
18. McIver A., and Weber T. Towards automated proof support for probabilistic distributed systems. Proceedings of Logic for Programs and Automated Reasoning. LNAI vol. 3835 (2005), Springer-Verlag
19. A.K. McIver, C.C. Morgan, J.W. Sanders, K. Seidel, Probabilistic Systems Group: Collected Reports. .
20. McIver A., and Morgan C. Abstraction, Refinement and Proof for Probabilistic Systems. Technical Monographs in Computer Science (2004), Springer-Verlag, New York
21. Möller B. Lazy Kleene algebra. In: Kozen D., and Shankland C. (Eds). Mathematics of Program Construction. LNCS vol. 3125 (2004), Springer 252-273
22. C. Morgan, Private communication, The Lamington model: a probabilistic model with miracles, 1995.
23. Carroll Morgan, The Shadow Knows: Refinement of ignorance in sequential programs, in: Math Prog Construction, 2006, pp. 359-378.
24. Morgan C.C., McIver A.K., and Seidel K. Probabilistic predicate transformers. ACM Trans. Programming Lang. Syst. 18 3 (1996) 325-353 doi:acm.org/10.1145/229542.229547
25. PRISM, Probabilistic symbolic model checker, www.cs.bham.ac.uk/~dxp/prism.
26. Rabin M.O. N-process mutual exclusion with bounded waiting by 4 log 2n-valued shared variable. J. Comput. Syst. Sci. 25 1 (1982) 66-75
27. J.R. Rao, Building on the UNITY Experience: compositionality, fairness and probability in parallelism, Ph.D. thesis, University of Texas at Austin, 1992.
28. I. Saias, Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion, in: Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, 1992.
29. Roberto Segala, Modeling and verification of randomized distributed real-time systems, Ph.D. thesis, MIT, 1995.
30. Takai T., and Furusawa H. Monodic tree kleene algebra. In: Struth G., and Schmidt R. (Eds). Proceedings of the 9th International Conference on Relational Methods in Computer Science. LNCS vol. 4136 (2006), Springer