Checking Zenon Modulo Proofs in Dedukti

Raphaël Cauderlier
(Inria)
Pierre Halmagrand
(Inria)

Dedukti has been proposed as a universal proof checker. It is a logical framework based on the lambda Pi calculus modulo that is used as a backend to verify proofs coming from theorem provers, especially those implementing some form of rewriting. We present a shallow embedding into Dedukti of proofs produced by Zenon Modulo, an extension of the tableau-based first-order theorem prover Zenon to deduction modulo and typing. Zenon Modulo is applied to the verification of programs in both academic and industrial projects. The purpose of our embedding is to increase the confidence in automatically generated proofs by separating untrusted proof search from trusted proof verification.

In Cezary Kaliszyk and Andrei Paskevich: Proceedings Fourth Workshop on Proof eXchange for Theorem Proving (PxTP 2015), Berlin, Germany, August 2-3, 2015, Electronic Proceedings in Theoretical Computer Science 186, pp. 57–73.
Published: 30th July 2015.

ArXived at: http://dx.doi.org/10.4204/EPTCS.186.7 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org