Quantitative temporal logic mechanized in HOL

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

Volumn 3722 LNCS, Issue , 2005, Pages 439-453

  Celiku, Orieta ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DATA HANDLING; RANDOM PROCESSES;

BOOLEAN VALUED FUNCTIONS; BRANCHING-TIME TEMPORAL LOGIC; NONDETERMINISM; RANDOMIZED ALGORITHMS;

PROBABILISTIC LOGICS;

EID: 33646394869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560647_29     Document Type: Conference Paper

References (24)

1. M. Ben-Ari, A. Pnueli, and Z. Manna. The temporal logic of branching time. Acta Informatica, 20:207-226, 1983.
2. O. Celiku and A. McIver. Cost-based analysis of probabilistic programs mechanised in HOL. Nordic Journal of Computing, 11(2):102-128, 2004.
3. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
4. Erlangen-Twente Markov Chain Checker. http://www.informatik.uni-erlangen. de/etmcc/.
5. M. J. C. Gordon and T. F. Melham. Introduction to HOL (A theorem-proving environment for higher order logic). Cambridge University Press, 1993.
6. V. Hartonas-Garmhausen, S. V. A. Campos, and E. M. Clarke. Probverus: Probabilistic symbolic model checking. In Formal Methods for Real-Time and Probabilistic Systems, 5th International AMAST Workshop, Proceedings, volume 1601 of Lecture Notes in Computer Science, pages 96-110. Springer, 1999.
7. T. S. Hoang, Z. Jin, K. Robinson, A. McIver, and C. Morgan. Probabilistic invariants for probabilistic machines. In ZB 2003: Formal Specification and Development in Z and B,Proceedings, volume 2651 of Lecture Notes in Computer Science, pages 240-259. Springer, 2003.
8. J. Hurd. Formal Verification of Probabilistic Algorithms. PhD thesis, University of Cambridge, 2002.
9. J. Hurd, A. McIver, and C. Morgan. Probabilistic guarded commands mechanized in HOL. In Proc. of QAPL 2004, Mar. 2004.
10. B. Jeannet, P. D'Argenio, and K. Larsen. RAPTURE: A tool for verifying Markov Decision Processes. In I. Cerna, editor, Tools Day'02, Brno, Czech Republic, Technical Report. Faculty of Informatics, Masaryk University Brno, 2002.
11. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
12. M. Kwiatkowska. G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In Proceedings of TOOLS 2002, volume 2324 of Lecture Notes in Computer Science, pages 200-204. Springer, Apr. 2002.
13. A. McIver and C. Morgan. Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL. Theoretical Computer Science, 293(3):507-534, 2003.
14. A. McIver and C. Morgan. Abstraction, refinement and proof for probabilistic systems. Springer, 2004.
15. A. McIver, C. Morgan, and T. S. Hoang. Probabilistic termination in B. In ZB 2003: Formal Specification and Development in Z and B, Proceedings, volume 2651 of Lecture Notes in Computer Science, pages 216-239. Springer, 2003.
16. A. K. McIver. Quantitative program logic and expected time bounds in probabilistic distributed algorithms. Theoretical Computer Science, 282:191-219, 2002.
17. C. Morgan. Probabilistic temporal logic: qTL. Lectures on Probabilistic Formal Methods for the 2004 RSISE Logic Summer School. Slides available at http://www.cse.unsw.edu.au/~carrollm/canberra04/.
18. C. Morgan and A. McIver. An expectation-transformer model for probabilistic temporal logic. Logic Journal of the IGPL, 7(6):779-804, 1999.
19. C. Morgan and A. McIver. pGCL: Formal reasoning for random algorithms. South African Computer Journal, 22:14-27, 1999.
20. C. C. Morgan. Programming from Specifications. Prentice-Hall, 1990.
21. C. C. Morgan, A. K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, May 1996.
22. G. Norman. Analysing randomized distributed algorithms. In Validation of Stochastic Systems, volume 2925 of Lecture Notes in Computer Science, pages 384-418. Springer-Verlag, 2004.
23. Probabilistic Symbolic Model Checker, http://www.cs.bham.ac.uk/dxp/prism/ .
24. Ymer. http://www.cs.cmu.edu/~lorens/ymer.html.