Formal Verification of a Partial-Order Reduction Technique for Model Checking
Journal of Automated Reasoning
A Verified Model Checker for the Modal µ-calculus in Coq
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A logic for reasoning about time and reability
A logic for reasoning about time and reability
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Certification of Termination Proofs Using CeTA
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
seL4: formal verification of an OS kernel
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
A Formally Verified Compiler Back-end
Journal of Automated Reasoning
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
The ins and outs of the probabilistic model checker MRMC
Performance Evaluation
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Three chapters of measure theory in Isabelle/HOL
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Formalization of entropy measures in HOL
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Formalization of finite-state discrete-time Markov chains in HOL
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Code generation via higher-order rewrite systems
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
Probabilistic model checkers like PRISM check the satisfiability of probabilistic CTL (pCTL) formulas against discrete-time Markov chains. We prove soundness and completeness of their underlying algorithm in Isabelle/HOL. We define Markov chains given by a transition matrix and formalize the corresponding probability measure on sets of paths. The formalization of pCTL formulas includes unbounded cumulated rewards.