2026-07-20T11:15:24Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4056 2024-03-06T10:34:45Z ddc:004 open_access

Compression of Rewriting Systems for Termination Analysis Bau, Alexander Lohrey, Markus Nöth, Eric Waldmann, Johannes termination of rewriting matrix interpretations constraint solving tree compression 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Alexander Bau and Markus Lohrey and Eric Nöth and Johannes Waldmann 2013 Is Part Of LIPIcs, Volume 21, 24th International Conference on Rewriting Techniques and Applications (RTA 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.RTA.2013.97 urn:nbn:de:0030-drops-40561 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2013.97 eng https://creativecommons.org/licenses/by/3.0/legalcode