Probabilistic Guarded Commands Mechanized in HOL
暂无分享,去创建一个
[1] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[2] T. Nipkow. Hoare Logics in Isabelle/HOL , 2002 .
[3] J. Grundy,et al. Theorem Proving in Higher Order Logics: 11th International Conference, TPHOLs'98, Canberra, Australia, September 27 - October 1, 1998, Proceedings , 1998 .
[4] Michael J. C. Gordon,et al. Mechanizing programming logics in higher order logic , 1989 .
[5] Michael Huth. The Interval Domain: A Matchmaker for aCTL and aPCTL , 1998, Electron. Notes Theor. Comput. Sci..
[6] Annabelle McIver,et al. Partial correctness for probabilistic demonic programs , 2001, Theor. Comput. Sci..
[7] Dexter Kozen,et al. A probabilistic PDL , 1983, J. Comput. Syst. Sci..
[8] Graham Birtwistle,et al. Current Trends in Hardware Verification and Automated Theorem Proving , 1989, Springer New York.
[9] Richard J. Boulton,et al. Theorem Proving in Higher Order Logics , 2003, Lecture Notes in Computer Science.
[10] Annabelle McIver,et al. Abstraction, Refinement and Proof for Probabilistic Systems , 2004, Monographs in Computer Science.
[11] Annabelle McIver,et al. Probabilistic Invariants for Probabilistic Machines , 2003, ZB.
[12] Robin Milner,et al. Edinburgh LCF , 1979, Lecture Notes in Computer Science.
[13] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .
[14] Carroll Morgan,et al. pGCL: formal reasoning for random algorithms , 1998 .
[15] Joe Hurd,et al. Formal verification of probabilistic algorithms , 2003 .
[16] Annabelle McIver,et al. Probabilistic predicate transformers , 1996, TOPL.
[17] Eyal Kushilevitz,et al. Randomized mutual exclusion algorithms revisited , 1992, PODC '92.
[18] Alan Bundy,et al. Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.
[19] Marta Z. Kwiatkowska,et al. PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.
[20] H. Schwichtenberg,et al. Proof and System-Reliability , 2002 .
[21] Carroll Morgan,et al. Proof rules for probabilistic loops , 1996 .
[22] John Harrison,et al. Formalizing Dijkstra , 1998, TPHOLs.
[23] David Carrington,et al. Using Theory Interpretation to Mechanise the Reals in a Theorem Prover , 2001, Electron. Notes Theor. Comput. Sci..