Zenon: an extensible automated theorem prover producing checkable proofs

Authors:
Richard Bonichon;David Delahaye;Damien Doligez
Affiliations:
LIP6-Paris 6, Paris, France;CEDRIC, CNAM, Paris, France;INRIA, Rocquencourt, France
Venue:
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Year:
2007

Citing 9
Cited 19

The TPTP Problem Library

Journal of Automated Reasoning
Autarkic Computations in Formal Proofs

Journal of Automated Reasoning
Automated Proof Construction in Type Theory Using Resolution

Journal of Automated Reasoning
System Description: IVY

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Formalisation and implementation of Access control models

ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Reasoning about Airport Security Regulations Using the Focal Environment

ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
Source-level proof reconstruction for interactive theorem proving

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
CASC-J3 the 3rd IJCAR ATP system competition

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Certifying airport security regulations using the Focal environment

FM'06 Proceedings of the 14th international conference on Formal Methods

Hashconsing in an incrementally garbage-collected system: a story of weak pointers and hashconsing in ocaml 3.10.2

Proceedings of the 2008 ACM SIGPLAN workshop on ML
Development of a Generic Voter under FoCal

TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
A declarative formal approach to dynamic reconfiguration

Proceedings of the 1st international workshop on Open component ecosystems
Development Life-cycle of Critical Software Under FoCaL

Electronic Notes in Theoretical Computer Science (ENTCS)
The TPTP Problem Library and Associated Infrastructure

Journal of Automated Reasoning
Resolution is Cut-Free

Journal of Automated Reasoning
Developing structured libraries using the Focal environment

Proceedings of the 1st Workshop on Modules and Libraries for Proof Assistants
Invariants for the FoCaL language

Annals of Mathematics and Artificial Intelligence
Functional testing in the focal environment

TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Improving Coq propositional reasoning using a lazy CNF conversion scheme

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Integrating implicit induction proofs into certified proof environments

IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Semi-automatic synthesis of security policies by invariant-guided abduction

FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
Verifying B proof rules using deep embedding and automated theorem proving

SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Verifying safety properties with the TLA+ proof system

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Automatic verification of TLA+ proof obligations with SMT solvers

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Development of secured systems by mixing programs, specifications and proofs in an object-oriented programming environment: a case study within the FoCaLiZe environment

Proceedings of the 7th Workshop on Programming Languages and Analysis for Security
Tableaux modulo theories using superdeduction: an application to the verification of B proof rules with the zenon automated theorem prover

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A framework for automated and certified refinement steps

Innovations in Systems and Software Engineering
One logic to use them all

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover of the Focal environment, an objectoriented algebraic specification and proof system, which is able to produce OCaml code for execution and Coq code for certification. Zenon can directly generate Coq proofs (proof scripts or proof terms), which can be reinserted in the Coq specifications produced by Focal. Zenon can also be extended, which makes specific (and possibly local) automation possible in Focal.