LIPIcs.RTA.2012.339.pdf
- Filesize: 0.54 MB
- 16 pages
Document
On the Formalization of Termination Techniques based on Multiset Orderings
Authors
-
Part of:
Volume:
23rd International Conference on Rewriting Techniques and Applications (RTA'12) (RTA 2012)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2012-05-29
Cite AsGet BibTex
René Thiemann, Guillaume Allais, and Julian Nagele. On the Formalization of Termination Techniques based on Multiset Orderings. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 339-354, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.RTA.2012.339
https://doi.org/10.4230/LIPIcs.RTA.2012.339
Abstract
Multiset orderings are a key ingredient in certain termination
techniques like the recursive path ordering and a variant of size-change termination. In order to integrate these techniques in a certifier for termination proofs, we have added them to the Isabelle
Formalization of Rewriting. To this end, it was required to extend the existing formalization on multiset orderings towards a generalized multiset ordering. Afterwards, the soundness proofs of both techniques have been established, although only after fixing some definitions.
Concerning efficiency, it is known that the search for suitable parameters for both techniques is NP-hard. We show that checking the correct application of the techniques--where all parameters are provided--is also NP-hard, since the problem of deciding the generalized multiset ordering is NP-hard.
Keywords
- formalization
- term rewriting
- termination
- orderings
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads