Towards automated proof support for probabilistic distributed systems

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

Volumn 3835 LNAI, Issue , 2005, Pages 534-548

  McIver, Annabelle K ^a   Weber, Tjark ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PROGRAMMING; CONCURRENCY CONTROL; DIGITAL ARITHMETIC; DISTRIBUTED COMPUTER SYSTEMS; PROBABILITY; THEOREM PROVING;

AUTOMATED PROOF SUPPORT; PROBABILISTIC DISTRIBUTED SYSTEMS; REAL-NUMBER ARITHMETIC;

DECISION SUPPORT SYSTEMS;

EID: 33745442942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_37     Document Type: Conference Paper

References (29)

1. T. Arons, A. Pnueli, and L. Zuck. Parameterized verification by probabilistic abstraction. In Proceedings of FOSSACS, number 2620 in LNCS, April 2003.
2. James Aspnes and M. Herlihy. Fast randomized consensus using shared memory. J. Algorithms, 11(3):441-61, 1990.
3. R.-J.R. Back and J. von Wright. The Refinement Calculus: A Systematic Introduction, Springer Verlag, 1998.
4. O. Celiku and A. Mclver. Cost-based analysis of probabilistic programs mechanised in HOL. Nordic Journal of Computing, 2004.
5. E. Cohen. Hypotheses in Kleene Algebra. Bellcore technical report, 1994.
6. E. Cohen. Lazy caching, Bellcore technical report, 1994.
7. E. Cohen. Separation and reduction. In Mathematics of Program Construction, 5th International Conference, volume 1837 of LNCS, pages 45-59. Springer, 2000.
8. Luca de Alfaro and T. Henzinger. Concurrent w-regular games. In Proc. 15th IEEE Symp. Logic in Computer Science. IEEE, 2000.
9. C. Derman. Finite State Markov Decision Processes. Academic Press, 1970.
10. Jifeng He, K. Seidel, and A.K. McIver. Probabilistic models for the guarded command language. Science, of Computer Programming, 28:171-192, 1997.
11. Thai Son Huang. The Development of a Probabilistic B Method and a Supporting Toolkit. PhD thesis, Dept. Engineering and Computer Science. In draft.
12. Joe Hurd, A.K. McIver, and C.C. Morgan. Probabilistic guarded commands mechanised in HOL. Proc. QAPL '04 (ETAPS), 2004.
13. D. Jackson. Alloy:A lightweight object modelling notation. ACM Transactions on Software. Engineering and Methodology (TOSEM), 11:256-290, 2002.
14. C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In Proceedings of the IEEE 4th Annual Symposium on Logic in Computer Science, pages 186-195, Los Alamitos, Calif., 1989. Computer Society Press.
15. B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proc. 6th Conf. LICS, 1991.
16. D. Kozen. Kleene algebra with tests and commutativity conditions. In Proceedings of TACAS, 1996.
17. M. Kwiatkowska, G. Norman, and D.Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. Proceedings of TACAS, 2002.
18. G. Lowe. Probabilities and priorities in timed CSP. Technical Monograph PRG-111, Oxford University Computing Laboratory, 1993. (DPhil Thesis).
19. A.K. McIver and C.C. Morgan. Abstraction, Refinement and Proof for Probabilistic Programs. Springer, 2005.
20. C.C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3), July 1988. Reprinted in [24].
21. C.C. Morgan. Programming from Specifications. Prentice-Hall, 1994.
22. C.C. Morgan. Private communication. 2004.
23. C.C. Morgan, A.K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, 1996.
24. C.C. Morgan and T.N. Vickers, editors. On the Refinement Calculus. FACIT Series in Computer Science. Springer Verlag, Berlin, 1994.
25. Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.
26. 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.
27. Roberto Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995.
28. N. Shankar. Automated verification using deduction, exploration and abstraction. In A.K. McIver and C.C. Morgan, editors, Programming Methodology. Springer, 2003.
29. Tjark Weber. Bounded model generation for Isabelle/HOL. In Wolfgang Ahrendt, Peter Baumgartner, Hans de Nivelle, Silvio Ranise, and Cesare Tinelli, editors, Selected Papers from the Workshops on Disproving and the Second International Workshop on Pragmatics of Decision Procedures (PDPAR 2004), volume 125 of ENTCS, pages 103-116. Elsevier, July 2005.