A verified model checker for the modal Μ-calculus in Coq

  • Christoph Sprenger
Regular Sessions Various Applications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1384)

Abstract

We report on the formalisation and correctness proof of a model checker for the modal Μ-calculus in Coq's constructive type theory. Using Coq's extraction mechanism we obtain an executable Caml program, which is added as a safe decision procedure to the system. We thereby avoid the generation of large proof objects while preserving the high reliability of the proof environment. An example illustrates the combination of model checking with deductive techniques.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Christoph Sprenger
    • 1
  1. 1.Computer Networking LaboratorySwiss Federal Institute of TechnologyLausanneSwitzerland

Personalised recommendations