article

Matrix Interpretations for Proving Termination of Term Rewriting

Authors:

Jörg Endrullis,

Johannes Waldmann,

Hans ZantemaAuthors Info & Claims

Journal of Automated Reasoning, Volume 40, Issue 2-3

Pages 195 - 220

https://doi.org/10.1007/s10817-007-9087-9

Published: 01 March 2008 Publication History

Abstract

We present a new method for automatically proving termination of term rewriting. It is based on the well-known idea of interpretation of terms where every rewrite step causes a decrease, but instead of the usual natural numbers we use vectors of natural numbers, ordered by a particular nontotal well-founded ordering. Function symbols are interpreted by linear mappings represented by matrices. This method allows us to prove termination and relative termination. A modification of the latter, in which strict steps are only allowed at the top, turns out to be helpful in combination with the dependency pair transformation. By bounding the dimension and the matrix coefficients, the search problem becomes finite. Our implementation transforms it to a Boolean satisfiability problem (SAT), to be solved by a state-of-the-art SAT solver.

References

[1]

Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comp. Sci. 236, 133-178 (2000).

Digital Library

[2]

Termination problems data base. http://www.lri.fr/~marche/tpdb/

[3]

Termination competition. http://www.lri.fr/~marche/termination-competition/

[4]

Dershowitz, N.: Termination of linear rewriting systems. In: Even, S., Kariv, O. (eds.) Proc. 8th Int. Coll. on Automata, Languages and Programming (ICALP-81). Lecture Notes in Computer Science, vol. 115, pp. 448-458. Springer (1981).

[5]

Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) Proc. 8th Int. Conf. Theory and Applications of Satisfiability Testing SAT 2005. Lecture Notes in Computer Science, vol. 3569, pp. 61-75. Springer (2005). Tool: http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat/.

[6]

Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. In: Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR '06). Lecture Notes in Computer Science, vol. 4130, pp. 574-588. Springer (2006).

[7]

Giesl, J., Schneider-Kamp, P., Thiemann, R.: Aprove 1.2: automatic termination proofs in the dependency pair framework. In: Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR '06). Lecture Notes in Computer Science, vol. 4130, pp. 281- 286. Springer (2006).

[8]

Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: combining techniques for automated termination proofs. In: Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004). Lecture Notes in Computer Science, vol. 3452, pp. 301-331. Springer (2005).

[9]

Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: van Oostrom, V. (ed.) Proceedings of the 15th Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 3091, pp. 249-268. Springer (2004).

[10]

Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. Inf. Comput. 199, 172-199 (2005).

Digital Library

[11]

Hirokawa, N., Middeldorp, A.: Tyrolean termination tool. In: Giesl, J. (ed.) Proceedings of the 16th Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 3467, pp. 175-184. Springer (2005).

[12]

Hirokawa, N., Middeldorp, A.: Uncurrying for termination. In: Proceedings of 3rd International Workshop on Higher-Order Rewriting (HOR), pp. 19-24. (2006).

[13]

Hofbauer, D., Lautemann, C.: Termination proofs and the length of derivations (preliminary version). In: Dershowitz, N. (ed.) Proceedings of the 3rd Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 355, pp, 167-177. Springer (1989).

[14]

Hofbauer, D., Waldmann, J.: Proving termination with matrix interpretations. In: Pfenning, F. (ed.) Proceedings of the 17th Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 4098, pp. 328-342. Springer (2006).

[15]

Hofbauer, D., Waldmann, J.: Termination of {aa¿bc, bb¿ac, cc¿ab}. Inf. Process. Lett. 98(4), 156-158 (2006).

Digital Library

[16]

The RTA list of open problems. http://www.lsv.ens-cachan.fr/rtaloop/

[17]

Full results of Jambox. http://joerg.endrullis.de/jar07/

[18]

Zantema, H.: Termination of term rewriting: interpretation and type elimination. J. Symb. Comput. 17, 23-50 (1994).

Digital Library

[19]

Zantema, H.: Termination. In: Term Rewriting Systems, by Terese, pp. 181-259. Cambridge University Press (2003).

[20]

Zantema, H.: Reducing right-hand sides for termination. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, vol. 3838, pp. 173-197. Springer (2005).

Cited By

Mitterwallner FMiddeldorp AThiemann RSobocinski PLago UEsparza J(2024)Linear Termination is UndecidableProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662081(1-12)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662081
Jia FHan RHuang PLiu MMa FZhang JJust RFraser G(2023)Improving Bit-Blasting for Nonlinear Integer ConstraintsProceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3597926.3598034(14-25)Online publication date: 12-Jul-2023
https://dl.acm.org/doi/10.1145/3597926.3598034
Yolcu EAaronson SHeule M(2023)An Automated Approach to the Collatz ConjectureJournal of Automated Reasoning10.1007/s10817-022-09658-867:2Online publication date: 25-Apr-2023
https://dl.acm.org/doi/10.1007/s10817-022-09658-8
Show More Cited By

Index Terms

Matrix Interpretations for Proving Termination of Term Rewriting

Recommendations

Proving termination of context-sensitive rewriting by transformation

Context-sensitive rewriting (CSR) is a restriction of rewriting that forbids reductions on selected arguments of functions. With CSR, we can achieve a terminating behavior with non-terminating term rewriting systems, by pruning (all) infinite rewrite ...
Proving Termination of Context-Sensitive Rewriting with MU-TERM

Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem with several applications in the fields of term rewriting and programming ...
Total termination of term rewriting

We investigate proving termination of term rewriting systems by a compositional interpretation of terms in a total well-founded order. This kind of termination is calledtotal termination. Equivalently total termination can be characterized by the ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Automated Reasoning

Journal of Automated Reasoning Volume 40, Issue 2-3

March 2008

156 pages

ISSN:0168-7433

Issue’s Table of Contents

Copyright © Copyright © 2008 Springer Science+Business Media B.V.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 March 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

47
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mitterwallner FMiddeldorp AThiemann RSobocinski PLago UEsparza J(2024)Linear Termination is UndecidableProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662081(1-12)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662081
Jia FHan RHuang PLiu MMa FZhang JJust RFraser G(2023)Improving Bit-Blasting for Nonlinear Integer ConstraintsProceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3597926.3598034(14-25)Online publication date: 12-Jul-2023
https://dl.acm.org/doi/10.1145/3597926.3598034
Yolcu EAaronson SHeule M(2023)An Automated Approach to the Collatz ConjectureJournal of Automated Reasoning10.1007/s10817-022-09658-867:2Online publication date: 25-Apr-2023
https://dl.acm.org/doi/10.1007/s10817-022-09658-8
Yamada A(2022)Tuple Interpretations for Termination of Term RewritingJournal of Automated Reasoning10.1007/s10817-022-09640-466:4(667-688)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1007/s10817-022-09640-4
Yamada A(2022)Term Orderings for Non-reachability of (Conditional) RewritingAutomated Reasoning10.1007/978-3-031-10769-6_15(248-267)Online publication date: 8-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-10769-6_15
Lucas S(2021)Derivational Complexity and Context-Sensitive RewritingJournal of Automated Reasoning10.1007/s10817-021-09603-165:8(1191-1229)Online publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1007/s10817-021-09603-1
Yolcu EAaronson SHeule M(2021)An Automated Approach to the Collatz ConjectureAutomated Deduction – CADE 2810.1007/978-3-030-79876-5_27(468-484)Online publication date: 12-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-030-79876-5_27
Yamada A(2021)Multi-Dimensional Interpretations for Termination of Term RewritingAutomated Deduction – CADE 2810.1007/978-3-030-79876-5_16(273-290)Online publication date: 12-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-030-79876-5_16
Lucas SMeseguer JGutiérrez R(2020)The 2D Dependency Pair Framework for Conditional Rewrite Systems—Part II: Advanced Processors and Implementation TechniquesJournal of Automated Reasoning10.1007/s10817-020-09542-364:8(1611-1662)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.1007/s10817-020-09542-3
Gutiérrez RLucas S(2020)mu-term: Verify Termination Properties Automatically (System Description)Automated Reasoning10.1007/978-3-030-51054-1_28(436-447)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.1007/978-3-030-51054-1_28
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents