6 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.LO2017★ 1 cited
A Proof Theory for Model Checking: An Extended Abstract
Quentin Heath, Dale Miller
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…
cs.LO2015★ 6 cited
A framework for proof certificates in finite state exploration
Quentin Heath, Dale Miller
Model checkers use automated state exploration in order to prove various properties such as reachability, non-reachability, and bisimulation over state transition systems. While mo…