Reseña: A fully verified executable LTL model checker
Se ha publicado un artículo de verificación formal con Isabelle/HOL titulado A fully verified executable LTL model checker.
Sus autores son Javier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf y Jan-Georg Smaus.
El trabajo se presentará en el CAV 2013 (25th International Conference on Computer Aided Verification).
Su resumen es
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 recent Isabelle technology called the 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. We report on the structure of the checker, the development process, and some experiments on standard benchmarks.
El trabajo forma parte del proyecto CAVA (Computer Aided Verification of Automata).
El código de las correspondientes teorías Isabelle/HOL se encuentra aquí.