VSL 2014: VIENNA SUMMER OF LOGIC 2014

The Certification Problem Format

Authors: Christian Sternagel and René Thiemann

PapersPapers with AbstractsPrefaceAuthor IndexKeyword Index

Paper Information

Title:The Certification Problem Format
Authors:Christian Sternagel and René Thiemann
Proceedings:UITP 2014 Proceedings
Editors: Bruno Woltzenlogel Paleo and Christoph Benzmüller
Keywords:term rewriting, certification, XML
Abstract:

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.

Pages:0
Talk:Jul 17 12:15
Paper:
Disclaimer | Powered by EasyChair Smart Program