Checking Zenon Modulo Proofs in Dedukti
Logic in Computer Science
2015-08-03 v1
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.
Keywords
Cite
@article{arxiv.1507.08719,
title = {Checking Zenon Modulo Proofs in Dedukti},
author = {Raphaël Cauderlier and Pierre Halmagrand},
journal= {arXiv preprint arXiv:1507.08719},
year = {2015}
}
Comments
In Proceedings PxTP 2015, arXiv:1507.08375