Quantcast

Checking Zenon Modulo Proofs in Dedukti

Research paper by Raphaël Cauderlier, Pierre Halmagrand

Indexed on: 30 Jul '15Published on: 30 Jul '15Published in: Computer Science - Logic in Computer Science



Abstract

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.