A proof theory for model checking - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2019

A proof theory for model checking


While model checking has often been considered as a practical alternative to building formal proofs, we argue here that the theory of sequent calculus proofs can be used to provide an appealing foundation for model checking. Since the emphasis of model checking is on establishing the truth of a property in a model, we rely on additive inference rules since these provide a natural description of truth values via inference rules. Unfortunately, using these rules alone can force the use of inference rules with an infinite number of premises. In order to accommodate more expressive and finitary inference rules, we also allow multiplicative rules but limit their use to the construction of additive synthetic inference rules: such synthetic rules are described using the proof-theoretic notions of polarization and focused proof systems. This framework provides a natural, proof-theoretic treatment of reachability and non-reachability problems, as well as tabled deduction, bisimulation, and winning strategies.
Fichier principal
Vignette du fichier
hal.pdf (424.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01814006 , version 1 (12-06-2018)



Quentin Heath, Dale Miller. A proof theory for model checking. Journal of Automated Reasoning, 2019, 63 (4), pp.857-885. ⟨10.1007/s10817-018-9475-3⟩. ⟨hal-01814006⟩
258 View
486 Download



Gmail Facebook X LinkedIn More