Using probabilistic kleene algebra for protocol verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4136 LNCS, Issue , 2006, Pages 296-310

  McIver, A K ^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

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; LOGIC PROGRAMMING; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

DEMONIC COMPUTATION; KLEENE ALGEBRA; PROBABILISTIC SYSTEMS; PROBABILISTIC VERIFICATION;

BOOLEAN ALGEBRA;

EID: 33750056050     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11828563_20     Document Type: Conference Paper

References (18)

1. E. Cohen. Separation and reduction. In Mathematics of Program Construction, 5th Intern. Conference, volume 1837 of LNCS, pages 45-59. Springer, July 2000.
2. J. Halpern and M. Tuttle. Knowledge, probabilities and adversaries. J. ACM, 40(4):917-962, 1993.
3. Jifeng He, K. Seidel, and A.K. McIver. Probabilistic models for the guarded command language. Science of Computer Programming, 28:171-92, 1997.
4. Earlier appeared in Proc. FMTA '95, Warsaw, May 1995. Available at [9, key HSM95].
5. Joe Hurd. A formal approach to probabilistic termination. In Víctor A. Carreño, César A. Muñoz, and Sofiène Tahar, editors, 15th International Conference on Theorem Proving in Higher Order Logics: TPHOLs 2002, volume 2410 of LNCS, pages 230-45, Hampton, VA., August 2002. Springer, www.cl.cam.ac.uk/~jeh1004/research/papers.
6. D. Kozen. Kleene algebra with tests. ACM Transactions on Programming Languages and Systems (TOPLAS), 19(3):427-443, 1997.
7. Eyal Kushilevitz and M.O. Rabin, Randomized mutual exclusion algorithms revisited. In Proc. 11th Annual ACM Symp. on Principles of Distributed Computing, 1992.
8. D. Lehmann and S. Shelah. Reasoning with time and chance. Information and Control, 53(3):165-98, 1982.
9. A. McIver and T. Weber. Towards automated proof support for probabilistic distributed systems. In Proceedings of Logic for Programming and Automated Reasoning, volume 3835 of LNAI, pages 534-548. Springer, 2005.
10. A.K. McIver, C.C. Morgan, J.W. Sanders, and K. Seidel. Probabilistic Systems Group; Collected reports, web.comlab.ox.ac.uk/oucl/research/areas/probs.
11. Annabelle McIver and Carroll Morgan. Abstraction, Refinement and Proof for Probabilistic Systems. Technical Monographs in Computer Science. Springer, 2004.
12. B. Moeller. Lazy Kleene Algebra. In D. Kozen and C. Shankland, editors, MPC, volume 3125 of Lecture Notes in Computer Science, pages 252-273. Springer, 2004.
13. C.C. Morgan, A.K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-53, 1996. doi.acm.org/10.1145/229542.229547.
14. PRISM. Probabilistic symbolic model checker. www.cs.bham.ac.uk/~dxp/ prism.
15. M.O. Rabin. N-process mutual exclusion with bounded waiting by 4 log 2n-valued shared variable. Journal of Computer and System Sciences, 25(1):66-75, 1982.
16. I. Saias. Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion. In Proc. 11th Annual ACM Symp. on Principles of Distributed Computing, 1992.
17. Roberto Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995.
18. T. Takai and H. Furusawa. Monadic tree Kleene Algebra. This proceedings: Relations and Kleene Algebras in Computer Science LNCS 4136.