Tyrolean Termination Tool: Techniques and features

Information and Computation

Volumn 205, Issue 4, 2007, Pages 474-511

  Hirokawa, Nao ^a   Middeldorp, Aart ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

Automation; Dependency pair method; Polynomial interpretations; Term rewriting; Termination

Indexed keywords

AUTOMATION; INFORMATION SYSTEMS;

BINARY FUNCTIONS; DEPENDENCY PAIR METHODS; NEGATIVE COEFFICIENTS; POLYNOMIAL INTERPRETATIONS; TERM REWRITING; TERMINATION; TERMINATION PROOF; UNARY FUNCTIONS;

COMPUTATIONAL METHODS;

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

References (44)

1. B. Alarcón, R. Gutiérrez, S. Lucas, Context-sensitive dependency pairs, in: Proceedings of the 26th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 4337, 2006, pp. 298-309.
2. T. Aoto, T. Yamada, Termination of simply typed term rewriting by translation and labelling, in: Proceedings of the 14th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 2706, 2003, pp. 380-394. (Pubitemid 36768734)
3. T. Aoto, T. Yamada, Termination of simply-typed applicative term rewriting systems, in: Proceedings of the 2nd International Workshop on Higher-Order Rewriting, Technical Report AIB-2004-03, RWTH Aachen, 2004, pp. 61-65.
4. T. Aoto, T. Yamada, Dependency pairs for simply typed term rewriting, in: Proceedings of the 16th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 3467, 2005, pp. 120-134. (Pubitemid 41313352)
5. T. Arts, J. Giesl, Termination of term rewriting using dependency pairs, Theoretical Computer Science 236(2000) 133-178.
6. T. Arts, J. Giesl, A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-09, RWTH Aachen, 2001.
7. F. Baader, T. Nipkow, Term Rewriting and All That, Cambridge University Press, 1998.
8. L. Bachmair, N. Dershowitz, Commutation, transformation, and termination, in: Proceedings of the 8th International Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 230, 2006, pp. 5-20.
9. C. Borralleras, M. Ferreira, A. Rubio, Complete monotonic semantic path orderings, in: Proceedings of the 17th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, vol. 1831, 2000, pp. 346-364.
10. E. Contejean, C. Marché, B. Monate, X. Urbain, CiME version 2, 2000. Available at http://cime.lri.fr/.
11. E. Contejean, C. Marché, A.-P. Tomás, X. Urbain, Mechanically proving termination using polynomial interpretations, Journal of Automated Reasoning 34(4) (2005) 325-363. (Pubitemid 44178627)
12. N. Dershowitz, 33 Examples of termination, in: French Spring School of Theoretical Computer Science, Lecture Notes in Computer Science, vol. 909, 1995, pp. 16-26.
13. N. Dershowitz, Termination by abstraction, in: Proceedings of the 20th International Conference on Logic Programming, Lecture Notes in Computer Science, vol. 3132, 2004, pp. 1-18.
14. J. Dick, J. Kalmus, U. Martin, Automating the Knuth-Bendix ordering, Acta Infomatica 28(1990) 95-119.
15. J. Endrullis, J. Waldmann, H. Zantema, Matrix interpretations for proving termination of term rewriting, in: Proceedings of the 3rd International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence, vol. 4130, 2006, pp. 574-588. (Pubitemid 44532702)
16. A. Geser, Relative Termination. PhD thesis, University of Passau, 1990.
17. A. Geser, D. Hofbauer, J. Waldmann, H. Zantema, On tree automata that certify termination of left-linear term rewriting systems, in: Proceedings of the 16th International Conference on Rewriting Techniques and Applications, vol. 3467, 2005, pp. 353-267.
18. J. Giesl, T. Arts, E. Ohlebusch, Modular termination proofs for rewriting using dependency pairs, Journal of Symbolic Computation 34(1) (2002) 21-58.
19. J. Giesl, P. Schneider-Kamp, R. Thiemann, AProVE 1.2: automatic termination proofs in the dependency pair framework, in: Proceedings of the 3rd International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence, vol. 4130, 2006, pp. 281-286. (Pubitemid 44532680)
20. J. Giesl, R. Thiemann, P. Schneider-Kamp, S. Falke, Improving dependency pairs, in: Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Lecture Notes in Artificial Intelligence, vol. 2850, 2003, pp. 165-179.
21. B. Gramlich, Generalized sufficient conditions for modular termination of rewriting, Applicable Algebra in Engineering, Communication and Computing 5(1994) 131-158.
22. B. Gramlich, S. Lucas, Simple termination of context-sensitive rewriting, in: Proceedings of the 3rd ACM Sigplan Workshop on Rule-based Programming, ACM Press, 2002, pp. 29-41.
23. N. Hirokawa, A. Middeldorp, Tsukuba Termination Tool, in: Proceedings of the 14th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 2706, 2003, pp. 311-320. (Pubitemid 36768729)
24. N. Hirokawa, A. Middeldorp, Dependency pairs revisited, in: Proceedings of the 16th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 3091, 2004, pp. 249-268.
25. N. Hirokawa, A. Middeldorp, Polynomial interpretations with negative coefficients, in: Proceedings of the 7th International Conference on Artificial Intelligence and Symbolic Computation, Lecture Notes in Artificial Intelligence, vol. 3249, 2004, pp. 185-198.
26. N. Hirokawa, A. Middeldorp, Automating the dependency pair method, Information and Computation 199 (1, 2) (2005) 172-199. (Pubitemid 40773678)
27. N. Hirokawa, A. Middeldorp, Tyrolean Termination Tool, in: Proceedings of the 16th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 3467, 2005, pp. 175-184. (Pubitemid 41313356)
28. H. Hong, D. Jakuš, Testing positiveness of polynomials, Journal of Automated Reasoning 21(1998) 23-28.
29. A. Koprowski, TPA: termination proved automatically, in: Proceedings of the 17th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 4098, 2006, pp. 257-266. (Pubitemid 44502671)
30. K. Korovin, A. Voronkov, Orienting rewrite rules with the Knuth-Bendix order, Information and Computation 183(2003) 165-186.
31. S. Lucas, Polynomials for proving termination of context-sensitive rewriting, in: Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, vol. 2987, 2004, pp. 318-332.
32. S. Lucas, Polynomials over the reals in proof oftermination: from theoryto practice, RAIRO Theoretical Informatics and Applications 39(3) (2005) 547-586. (Pubitemid 41048020)
33. A. Middeldorp, Approximations for strategies and termination, in: Proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming, Electronic Notes in Theoretical Computer Science, vol. 70(6), 2002.
34. A. Middeldorp, H. Ohsaki, Type introduction for equational rewriting, Acta Informatica 36(12) (2000) 1007-1029.
35. B. C. Pierce, Types and Programming Languages, MIT Press, 2002.
36. J. Steinbach, U. Kühler, Check your ordering-termination proofs and open problems. Technical Report SR-90-25, Universität Kaiserslautern, 1990.
37. Terese, Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, vol. 55, 2003.
38. Termination Problem Data Base. Available at http://www.lri.fr/~marche/ tpdb.
39. R. Thiemann, J. Giesl, The size-change principle and dependency pairs for termination of term rewriting, Applicable Algebra in Engineering, Communication and Computing 16(4) (2005) 229-270. (Pubitemid 41499194)
40. R. Thiemann, J. Giesl, P. Schneider-Kamp, Improved modular termination proofs using dependency pairs, in: Proceedings of the 2nd International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence, vol. 3097, 2004, pp. 75-90. (Pubitemid 38939962)
41. Y. Toyama, Counter examples to the termination for the direct sum of term rewriting systems, Information Processing Letters 25(1987) 141-143. (Pubitemid 17600701)
42. X. Urbain, Modular and incremental automated termination proofs, Journal of Automated Reasoning 32(2004) 315-355.
43. J. Waldmann, Matchbox: a tool for match-bounded string rewriting, in: Proceedings of the 15th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 3091, 2004, pp. 85-94.
44. H. Zantema, Termination of term rewriting by semantic labelling, Fundamenta Informaticae 24(1995) 89-105.