Match-bounds revisited

Information and Computation

Volumn 207, Issue 11, 2009, Pages 1259-1283

  Korp, Martin ^a   Middeldorp, Aart ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

Automation; Dependency pairs; Match bounds; Term rewriting; Termination; Tree automata

Indexed keywords

DEPENDENCY PAIRS; MATCH-BOUNDS; TERM REWRITING; TERMINATION; TREE AUTOMATA;

SYSTEMS ANALYSIS; TRANSLATION (LANGUAGES);

ROBOTS;

EID: 69949154081     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2009.02.010     Document Type: Article

References (28)

1. Geser A., Hofbauer D., and Waldmann J. Match-bounded string rewriting systems. Applicable Algebra in Engineering, Communication and Computing 15 3-4 (2004) 149-171
2. Geser A., Hofbauer D., Waldmann J., and Zantema H. On tree automata that certify termination of left-linear term rewriting systems. Information and Computation 205 4 (2007) 512-534
3. J. Endrullis, D. Hofbauer, J. Waldmann, Decomposing terminating rewrite relations, in: Proceedings of the Eighth International Workshop on Termination (WST), 2006, pp. 39-43.
4. Geser A., Hofbauer D., and Waldmann J. Termination proofs for string rewriting systems via inverse match-bounds. Journal of Automated Reasoning 34 4 (2005) 365-385
5. Geser A., Hofbauer D., Waldmann J., and Zantema H. Finding finite automata that certify termination of string rewriting systems. International Journal of Foundations of Computer Science 16 3 (2005) 471-486
6. J. Giesl, P. Schneider-Kamp, R. Thiemann, AProVE 1.2: automatic termination proofs in the dependency pair framework, in: Proceedings of the Third International Joint Conference on Automated Reasoning (IJCAR), Lecture Notes in Artificial Intelligence, vol. 4130, 2006, pp. 281-286.
7. Jambox, Available from: .
8. J. Waldmann, Matchbox: a tool for match-bounded string rewriting, in: Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, vol. 3091, 2004, pp. 85-94.
9. Zantema H. Termination of rewriting proved automatically. Journal of Automated Reasoning 34 2 (2005) 105-139
10. J. Giesl, R. Thiemann, P. Schneider-Kamp, The dependency pair framework: combining techniques for automated termination proofs, in: Proceedings of the 11th International Conference on Logic Programming and Automated Reasoning (LPAR), Lecture Notes in Artificial Intelligence, vol. 3425, 2004, pp. 301-331.
11. R. Thiemann, The DP framework for proving termination of term rewriting, Ph.D. Thesis, RWTH Aachen, Available as technical report AIB-2007-17 (2007).
12. M. Korp, A. Middeldorp, Proving termination of rewrite systems using bounds, in: Proceedings of the 18th International Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, vol. 4533, 2007, pp. 273-287.
13. M. Korp, A. Middeldorp, Match-bounds with dependency pairs for proving termination of rewrite systems, in: Proceedings of the Second International Conference on Language and Automata Theory and Applications (LATA), Lecture Notes in Computer Science, vol. 5196, 2008, pp. 321-332.
14. Baader F., and Nipkow T. Term Rewriting and All That (1998), Cambridge University Press, Cambridge
15. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, M. Tommasi, Tree automata techniques and applications, 2002. Available from: .
16. Dershowitz N. Orderings for term-rewriting systems. Theoretical Computer Science 17 3 (1982) 279-301
17. T. Genet, Decidable approximations of sets of descendants and sets of normal forms, in: Proceedings of the Ninth International Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, vol. 1379, 1998, pp. 151-165.
18. A. Middeldorp, Approximating dependency graphs using tree automata techniques, in: Proceedings of the First International Joint Conference on Automated Reasoning (IJCAR), Lecture Notes in Artificial Intelligence, vol. 2083, 2001, pp. 593-610.
19. Nagaya T., and Toyama Y. Decidability for left-linear growing term rewriting systems. Information and Computation 178 2 (2002) 499-514
20. Arts T., and Giesl J. Termination of term rewriting using dependency pairs. Theoretical Computer Science 236 1-2 (2000) 133-178
21. J. Giesl, R. Thiemann, P. Schneider-Kamp, Proving and disproving termination of higher-order functions, in: Proceedings of the Fifth International Workshop on Frontiers of Combining Systems (FroCoS), Lecture Notes in Artificial Intelligence, vol. 3717, 2005, pp. 216-231.
22. J. Giesl, R. Thiemann, P. Schneider-Kamp, S. Falke, Improving dependency pairs, in: Proceedings of the 10th International Conference on Logic Programming and Automated Reasoning (LPAR), Lecture Notes in Artificial Intelligence, vol. 2850, 2003, pp. 167-182.
23. Hirokawa N., and Middeldorp A. Tyrolean termination tool: techniques and features. Information and Computation 205 4 (2007) 474-511
24. Giesl J., Thiemann R., Schneider-Kamp P., and Falke S. Mechanizing and improving dependency pairs. Journal of Automated Reasoning 37 3 (2006) 155-203
25. O. Geupel, Overlap closures and termination of term rewriting systems, Report MIP-8922, Universität Passau, 1989.
26. N. Dershowitz, Termination of linear rewriting systems (preliminary version), in: Proceedings of the Eighth International Colloquium on Automata, Languages and Programming (ICALP), vol. 115, 1981, pp. 448-458.
27. Tyrolean Termination Tool 2, Available from: .
28. Hirokawa N., and Middeldorp A. Automating the dependency pair method. Information and Computation 199 1-2 (2005) 172-199