License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITP.2021.6
URN: urn:nbn:de:0030-drops-139010
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13901/
Baek, Seulkee
A Formally Verified Checker for First-Order Proofs
Abstract
The Verified TESC Verifier (VTV) is a formally verified checker for the new Theory-Extensible Sequent Calculus (TESC) proof format for first-order ATPs. VTV accepts a TPTP problem and a TESC proof as input, and uses the latter to verify the unsatisfiability of the former. VTV is written in Agda, and the soundness of its proof-checking kernel is verified in respect to a first-order semantics formalized in Agda. VTV shows robust performance in a comprehensive test using all eligible problems from the TPTP problem library, successfully verifying all but the largest 5 of 12296 proofs, with >97% of the proofs verified in less than 1 second.
BibTeX - Entry
@InProceedings{baek:LIPIcs.ITP.2021.6,
author = {Baek, Seulkee},
title = {{A Formally Verified Checker for First-Order Proofs}},
booktitle = {12th International Conference on Interactive Theorem Proving (ITP 2021)},
pages = {6:1--6:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-188-7},
ISSN = {1868-8969},
year = {2021},
volume = {193},
editor = {Cohen, Liron and Kaliszyk, Cezary},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13901},
URN = {urn:nbn:de:0030-drops-139010},
doi = {10.4230/LIPIcs.ITP.2021.6},
annote = {Keywords: TESC, TPTP, TSTP, ATP}
}
