Model checkers use automated state exploration in order to prove various properties such as reach-ability, non-reachability, and bisimulation over state transition systems. While model checkers have proved valuable for locating errors in computer models and specifications, they can also be used to prove properties that might be consumed by other… (More)
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 the proof theoretic notion of… (More)
Support has been obtained for this work from the following sources: from INRIA (first through the " Équipes Associées " Slimmer, and the " ADT " BATT), and from the NSF Grants CCR-0429572 (that also included support for Slimmer) and OISE-0553462.