The Bedwyr system for model checking over syntactic expressions

Simple item page
dc.creatorBaelde, David
dc.creatorGacek, Andrew
dc.creatorMiller, Dale
dc.creatorNadathur, Gopalan
dc.creatorTiu, Alwen
dc.date2007-02-20
dc.date2008-04-25
dc.date.accessioned2026-07-07T09:35:03Z
dc.date.available2026-07-07T09:35:03Z
dc.descriptionBedwyr 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 higher-order abstract syntax is directly supported using term-level $λ$-binders and the $\nabla$ quantifier. These features allow reasoning directly on expressions containing bound variables.
dc.description6 page system description. Appeared in CADE 2007
dc.identifierhttps://arxiv.org/abs/cs/0702116
dc.identifierhttp://arxiv.org/abs/cs/0702116
dc.identifierCADE 2007: 21th Conference on Automated Deduction, Frank Pfenning, editor, LNAI 4603, pages 391-397. Springer, 2007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159708
dc.subjectLogic in Computer Science
dc.titleThe Bedwyr system for model checking over syntactic expressions
dc.typetext

Files

Collections

arXiv