The Bedwyr system for model checking over syntactic expressions

Details The Bedwyr system for model checking over syntactic expressions The Bedwyr system for model checking over syntactic expressions

2007-02-20

arxiv.org/abs/cs/0702116v2

CADE 2007: 21th Conference on Automated Deduction, Frank Pfenning, editor, LNAI 4603, pages 391-397. Springer, 2007

Computer Science

Logic in Computer Science

6 page system description. Appeared in CADE 2007

Scientific paper

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 higher-order abstract syntax is directly supported using term-level $\lambda$-binders and the $\nabla$ quantifier. These features allow reasoning directly on expressions containing bound variables.

Affiliated with

Also associated with

No associations

Rating

The Bedwyr system for model checking over syntactic expressions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Bedwyr system for model checking over syntactic expressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Bedwyr system for model checking over syntactic expressions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-383380