Checking Zenon Modulo Proofs in Dedukti

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...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Cauderlier, Raphaël, Halmagrand, Pierre
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 31.07.2015
Subjects
Computer Science - Logic in Computer Science
Deduction
Embedding
Program verification (computers)
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.1507.08719