Team Parsifal
Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Other Grants and Activities
Dissemination
Bibliography
previous up next PDF XML

Section: Software

Bedwyr

Participants : Dale Miller, David Baelde [ correspondant ] .

Bedwyr is a generalization of logic programming that allows model checking directly on syntactic expression possibly containing bindings. This system, written in OCaml, is a direct implementation of two recent advances in the theory of proof search.

  1. It is possible to capture both finite success and finite failure in a sequent calculus. Proof search in such a proof system can capture both may and must behavior in operational semantics.

  2. Higher-order abstract syntax is directly supported using term-level $ \lambda$ -binders, the $ \nabla$ -quantifier, higher-order pattern unification, and explicit substitutions. These features allow reasoning directly on expressions containing bound variables.

The distributed system comes with several example applications, including the finite $ \pi$ -calculus (operational semantics, bisimulation, trace analysis, and modal logics), the spi-calculus (operational semantics), value-passing CCS, the $ \lambda$ -calculus, winning strategies for games, and various other model checking problems.

While the system has been written to validate certain theoretic results and to help suggest new theoretical directions, we believe that the system can be of use to others interested more in reasoning about computer systems than about proof theory foundations.

Bedwyr is an open source project hosted by INRIA's GForge. We welcome contributions from others of example applications and new features. The developers behind the current distribution are:

The developers thank Brigitte Pientka, for her advice regarding tabling, and Axelle Ziegler, for her help in translating an early implementation from SML to OCaml. Much of the effort for this work is supported within the context of the Slimmer project, which is supported by funds from INRIA and NSF.

The system's document and sources can be found at http://slimmer.gforge.inria.fr/bedwyr/ . Version 1.0 of Bedwyr was released on November 1st, 2006. About 65 downloads of the system were made during the following six weeks.

  1. Mixing Finite Success and Finite Failure in an Automated Prover by A. Tui, G. Nadathur, and D. Miller. (pdf)

  2. Model checking for pi-calculus using proof search by Alwen Tiu. In Proceedings of CONCUR 2005, LNCS Vol. 3653, pages 36 - 50, Springer-Verlag, 2005. (pdf).

  3. A proof theory for generic judgments by Dale Miller and Alwen Tiu. ACM Trans. on Computational Logic, 6(4):749-783, October 2005. (.pdf).


previous
next

Logo Inria