Zenon: an Extensible Automated Theorem Prover Producing Checkable Proofs - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Zenon: an Extensible Automated Theorem Prover Producing Checkable Proofs

(1) , (2) , (3)
1
2
3

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 object-oriented 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.
Fichier principal
Vignette du fichier
bonichon-delahaye-doligez-lpar-2007.pdf (362.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00315920 , version 1 (01-09-2008)

Identifiers

Cite

Richard Bonichon, David Delahaye, Damien Doligez. Zenon: an Extensible Automated Theorem Prover Producing Checkable Proofs. LPAR 2007 - 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Oct 2007, Yerevan, Armenia. pp.151-165, ⟨10.1007/978-3-540-75560-9_13⟩. ⟨inria-00315920⟩
374 View
322 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More