LIPIcs.RTA.2013.97.pdf
- Filesize: 0.51 MB
- 16 pages
Document
Compression of Rewriting Systems for Termination Analysis
Authors
-
Part of:
Volume:
24th International Conference on Rewriting Techniques and Applications (RTA 2013)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2013-06-24
Cite AsGet BibTex
Alexander Bau, Markus Lohrey, Eric Nöth, and Johannes Waldmann. Compression of Rewriting Systems for Termination Analysis. In 24th International Conference on Rewriting Techniques and Applications (RTA 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 21, pp. 97-112, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/LIPIcs.RTA.2013.97
https://doi.org/10.4230/LIPIcs.RTA.2013.97
Abstract
We adapt the TreeRePair tree compression algorithm and use it as an intermediate step in proving termination of term rewriting systems. We introduce a cost function that approximates the size of constraint systems that specify compatibility of matrix interpretations. We show how to integrate the compression algorithm with the Dependency Pairs transformation. Experiments show that compression reduces running times of constraint solvers, and thus improves the power of automated termination provers.
Keywords
- termination of rewriting
- matrix interpretations
- constraint solving
- tree compression
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads