Maximal termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5117 LNCS, Issue , 2008, Pages 110-125

  Fuhs, Carsten ^a   Giesl, Jürgen ^a   Middeldorp, Aart ^b   Schneider Kamp, Peter ^a   Thiemann, René ^b   Zankl, Harald ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

AUTOMATIC METHODS; DEPENDENCY PAIRS; INTERNATIONAL CONFERENCES; NEGATIVE COEFFICIENTS; NEW APPROACHES; POLYNOMIAL INTERPRETATIONS;

POLYNOMIALS;

EID: 48949102414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70590-1_8     Document Type: Conference Paper

References (18)

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133-178 (2000)
2. Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: SAT solving for termination analysis with polynomial interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 340-354. Springer, Heidelberg (2007)
3. Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal termination. Technical Report AIB-2008-03, RWTH Aachen, Germany (2008), http://aib.informatik.rwth-aachen.de
4. Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: Combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 301-331. Springer, Heidelberg (2005)
5. Giesl, J., Thiemann, R., Schneider-Kamp, P.: AProVE 1.2: Automatic termination proofs in the dependency pair framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 281-286. Springer, Heidelberg (2006)
6. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. Journal of Automated Reasoning 37(3), 155-203 (2006)
7. Giesl, J., Thiemann, R., Swiderski, S., Schneider-Kamp, P.: Proving termination by bounded increase. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 443-459. Springer, Heidelberg (2007)
8. Hardin, T., Laville, A.: Proof of termination of the rewriting system SUBST on CCL. Theoretical Computer Science 46(2,3), 305-312 (1986)
9. Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. Information and Computation 199(1,2), 172-199 (2005)
10. Hirokawa, N., Middeldorp, A.: Tyrolean Termination Tool: Techniques and features. Information and Computation 205(4), 474-511 (2007)
11. Hong, H., Jakuš, D.: Testing positiveness of polynomials. Journal of Automated Reasoning 21(1), 23-38 (1998)
12. Koprowski, A.: TPA: Termination proved automatically. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 257-266. Springer, Heidelberg (2006)
13. Lankford, D.: On proving term rewriting systems are Noetherian. Technical Report MTP-3, Louisiana Technical University, Ruston, LA, USA (1979)
14. Marché, C., Zantema, H.: The termination competition. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 303-313. Springer, Heidelberg (2007)
15. Nguyen, M., De Schreye, D., Giesl, J., Schneider-Kamp, P.: Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. KU Leuven (2008)
16. Toyama, Y.: Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters 25, 141-143 (1987)
17. 2, http://colo6-c703.uibk.ac.at/ttt2
18. Zantema, H.: Termination. In: Terese (ed.) Term Rewriting Systems, ch. 6, pp. 181-259. Cambridge University Press, Cambridge (2003)