Compression of Rewriting Systems for Termination Analysis

Authors Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann

Thumbnail PDF


  • Filesize: 0.51 MB
  • 16 pages

Document Identifiers

Author Details

Alexander Bau
Markus Lohrey
Eric Nöth
Johannes Waldmann

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)


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.
  • termination of rewriting
  • matrix interpretations
  • constraint solving
  • tree compression


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads