LIPIcs.RTA.2010.325.pdf
- Filesize: 199 kB
- 16 pages
Document
Certified Subterm Criterion and Certified Usable Rules
Authors
-
Part of:
Volume:
Proceedings of the 21st International Conference on Rewriting Techniques and Applications
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication date: 2010-07-06
Cite AsGet BibTex
Christian Sternagel and René Thiemann. Certified Subterm Criterion and Certified Usable Rules. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), Volume 6, pp. 325-340, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/LIPIcs.RTA.2010.325
https://doi.org/10.4230/LIPIcs.RTA.2010.325
Abstract
In this paper we present our formalization of two important
termination techniques for term rewrite systems: the subterm criterion and
the reduction pair processor in combination with usable rules. For both
techniques we developed executable check functions in the theorem prover
Isabelle/HOL which can certify the correct application of these techniques
in some given termination proof. As there are several variants of usable
rules we designed our check function in such a way that it accepts all
known variants, even those which are not explicitly spelled out in previous
papers.
We integrated our formalization in the publicly available IsaFoR-library.
This led to a significant increase in the power of CeTA, the corresponding
certified termination proof checker that is extracted from IsaFoR.
Keywords
- Term Rewriting
- Certification
- Termination
- Theorem Proving
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads