DMCA
Mechanized metatheory model-checking (2007)
Cached
Download Links
- [homepages.inf.ed.ac.uk]
- [homepages.inf.ed.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | In 9th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming |
| Citations: | 10 - 0 self |
BibTeX
@INPROCEEDINGS{Cheney07mechanizedmetatheory,
author = {James Cheney},
title = {Mechanized metatheory model-checking},
booktitle = {In 9th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming},
year = {2007},
pages = {75--86}
}
Share
 |
 |
 |
 |
||
OpenURL
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 received comparatively little attention. In this paper, we consider the problem of bounded model-checking 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.
Keyphrases
mechanized metatheory model-checking metatheoretic property nominal logic metatheory verification dual problem formal system operational semantics current state negation elimination bounded model-checking language calculus type system considerable attention experimental result related formal system little attention
