| Autor: |
Bau, Alexander, Lohrey, Markus, Nöth, Eric, Waldmann, Johannes |
| Jazyk: |
angličtina |
| Rok vydání: |
2013 |
| Předmět: |
|
| DOI: |
10.4230/lipics.rta.2013.97 |
| Popis: |
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. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
