Article contents
αCheck: A mechanized metatheory model checker*
Published online by Cambridge University Press: 22 May 2017
Abstract
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has received considerable attention recently. However, the dual problem of searching for errors in such formalizations has attracted comparatively little attention. In this article, we present αCheck, a bounded model checker for metatheoretic properties of formal systems specified using nominal logic. In contrast to the current state of the art for metatheory verification, our approach is fully automatic, does not require expertise in theorem proving on the part of the user, and produces counterexamples in the case that a flaw is detected. We present two implementations of this technique, one based on negation-as-failure and one based on negation elimination, along with experimental results showing that these techniques are fast enough to be used interactively to debug systems as they are developed.
- Type
- Regular Papers
- Information
- Copyright
- Copyright © Cambridge University Press 2017
Footnotes
This research was supported by EPSRC grant GR/S63205/01 and a Royal Society University Research Fellowship.
References
- 4
- Cited by