Back to Search Start Over

The Certification Problem Format

Authors :
Christian Sternagel
René Thiemann
Source :
Electronic Proceedings in Theoretical Computer Science, Vol 167, Iss Proc. UITP 2014, Pp 61-72 (2014)
Publication Year :
2014
Publisher :
Open Publishing Association, 2014.

Abstract

We provide an overview of CPF, the certification problem format, and explain some design decisions. Whereas CPF was originally invented to combine three different formats for termination proofs into a single one, in the meanwhile proofs for several other properties of term rewrite systems are also expressible: like confluence, complexity, and completion. As a consequence, the format is already supported by several tools and certifiers. Its acceptance is also demonstrated in international competitions: the certified tracks of both the termination and the confluence competition utilized CPF as exchange format between automated tools and trusted certifiers.

Details

Language :
English
ISSN :
20752180
Volume :
167
Issue :
Proc. UITP 2014
Database :
Directory of Open Access Journals
Journal :
Electronic Proceedings in Theoretical Computer Science
Publication Type :
Academic Journal
Accession number :
edsdoj.24aa887fe80b4ed79500ff0ed4f4a4a9
Document Type :
article
Full Text :
https://doi.org/10.4204/EPTCS.167.8