DMCA
The Bedwyr system for model checking over syntactic expressions (2007)
Cached
Download Links
| Venue: | 21th Conference on Automated Deduction, LNAI 4603, 391–397 |
| Citations: | 29 - 18 self |
BibTeX
@INPROCEEDINGS{Baelde07thebedwyr,
author = {David Baelde and Andrew Gacek and Dale Miller and Gopalan Nadathur and Alwen Tiu and École Polytechnique},
title = {The Bedwyr system for model checking over syntactic expressions},
booktitle = {21th Conference on Automated Deduction, LNAI 4603, 391–397},
year = {2007},
pages = {391--397},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Bedwyr is a generalization of logic programming that allows model checking directly on syntactic expressions possibly containing bindings. This system, written in OCaml, is a direct implementation of two recent advances in the theory of proof search. The first is centered on the fact that both finite success and finite failure can be captured in the sequent calculus by incorporating inference rules for definitions that allow fixed points to be explored. As a result, proof search in such a sequent calculus can capture simple model checking problems as well as may and must behavior in operational semantics. The second is that higherorder abstract syntax is directly supported using term-level λ-binders and the quantifier known as ∇. These features allow reasoning directly on expressions containing bound variables. 2
