CAVA LTL Modelchecker
CAVA_LTL_Modelchecker: A Fully Verified Executable LTL Model Checker. We present an LTL model checker whose code has been completely verified using the Isabelle theorem prover. The checker consists of over 4000 lines of ML code. The code is produced using the Isabelle Refinement Framework, which allows us to split its correctness proof into (1) the proof of an abstract version of the checker, consisting of a few hundred lines of “formalized pseudocode”, and (2) a verified refinement step in which mathematical sets and other abstract structures are replaced by implementations of efficient structures like red-black trees and functional arrays. This leads to a checker that, while still slower than unverified checkers, can already be used as a trusted reference implementation against which advanced implementations can be tested. An early version of this model checker is described in the CAV 2013 paper with the same title.
Keywords for this software
References in zbMATH (referenced in 13 articles )
Showing results 1 to 13 of 13.
Sorted by year (- Lammich, Peter: Refinement to imperative HOL (2019)
- Lammich, Peter; Lochbihler, Andreas: Automatic refinement to efficient data structures: a comparison of two approaches (2019)
- Abdulaziz, Mohammad; Norrish, Michael; Gretton, Charles: Formally verified algorithms for upper-bounding state space diameters (2018)
- Bauereiß, Thomas; Pesenti Gritti, Armando; Popescu, Andrei; Raimondi, Franco: CoSMed: a confidentiality-verified social media platform (2018)
- Brunner, Julian; Lammich, Peter: Formal verification of an executable LTL model checker with partial order reduction (2018)
- Hölzl, Johannes: Markov chains and Markov decision processes in Isabelle/HOL (2017)
- Kunčar, Ondřej; Popescu, Andrei: Comprehending Isabelle/HOL’s consistency (2017)
- Bauereiß, Thomas; Pesenti Gritti, Armando; Popescu, Andrei; Raimondi, Franco: CoSMed: a confidentiality-verified social media platform (2016)
- Dobrikov, Ivaylo; Leuschel, Michael: Optimising the ProB model checker for B using partial order reduction (2016)
- Esparza, Javier; Křetínský, Jan; Sickert, Salomon: From LTL to deterministic automata. A safraless compositional approach (2016)
- Aransay, Jesús; Divasón, Jose: Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm (2015)
- Noschinski, Lars: A graph library for Isabelle (2015)
- Esparza, Javier; Lammich, Peter; Neumann, René; Nipkow, Tobias; Schimpf, Alexander; Smaus, Jan-Georg: A fully verified executable LTL model checker (2013) ioport