Formal Verification of an Executable LTL Model Checker with Partial Order Reduction

@article{Brunner2016FormalVO,
  title={Formal Verification of an Executable LTL Model Checker with Partial Order Reduction},
  author={Julian Brunner and Peter Lammich},
  journal={Journal of Automated Reasoning},
  year={2016},
  volume={60},
  pages={3-21}
}
We present a formally verified and executable on-the-fly LTL model checker that uses ample set partial order reduction. The verification is done using the proof assistant Isabelle/HOL and covers everything from the abstract correctness proof down to the generated SML code. Building on Doron Peled’s paper “Combining Partial Order Reductions with On-the-Fly… CONTINUE READING