Loop detection in term rewriting using the eliminating unfoldings

Theoretical Computer Science

Volumn 403, Issue 2-3, 2008, Pages 307-327

  Payet, Étienne ^a  

^a UNIVERSITÉ DE LA RÉUNION   (France)

Author keywords

Loop; Non termination; Term rewriting system; Unfoldings; Useless rule

Indexed keywords

STANDARDS;

LOOP DETECTION; SUBTERMS; TERM REWRITING; UNFOLDING PROCESS; UNFOLDINGS;

MOLECULAR INTERACTIONS;

EID: 48449084601     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.05.013     Document Type: Article

References (48)

1. Alpuente M., Comini M., Escobar S., Falaschi M., and Lucas S. Abstract diagnosis of functional programs. In: Leuschel M. (Ed). Proc. of the 12th International Symposium on Logic-based Program Synthesis and Transformation. LOPSTR'02. Lecture Notes in Computer Science vol. 2664 (2003), Springer-Verlag 1-16
2. Alpuente M., Falaschi M., and Manzo F. Analyses of unsatisfiability for equational logic programming. Journal of Logic Programming 311 1-3 (1995) 479-525
3. Alpuente M., Falaschi M., Moreno G., and Vidal G. Safe folding/unfolding with conditional narrowing. In: Hanus M., Heering J., and Meinke K. (Eds). Proc. of Algebraic and Logic Programming, 6th International Joint Conference. ALP/HOA 97. Lecture Notes in Computer Science vol. 1298 (1997), Springer-Verlag 1-15
4. Alpuente M., Falaschi M., Moreno G., and Vidal G. Rules + strategies for transforming lazy functional logic programs. Theoretical Computer Science 311 1-3 (2004) 479-525
5. Alpuente M., Falaschi M., José Ramis M., and Vidal G. Narrowing approximations as an optimization for equational logic programs. In: Bruynooghe M., and Penjam J. (Eds). Proc. of the 5th International Symposium on Programming Language Implementation and Logic Programming. PLILP'93. Lecture Notes in Computer Science vol. 714 (1993), Springer-Verlag 391-409
6. AProVE's web site. http://aprove.informatik.rwth-aachen.de/
7. Arts T., and Giesl J. Termination of term rewriting using dependency pairs. Theoretical Computer Science 236 (2000) 133-178
8. Franz Baader, Tobias Nipkow, Term rewriting and all that, Cambridge, 1998
9. Burstall R.M., and Darlington J. A transformation system for developing recursive programs. Journal of the ACM 24 1 (1977) 44-67
10. Chabin J., and Réty P. Narrowing directed by a graph of terms. In: Goos G., and Hartmanis J. (Eds). Proc. of the 4th International Conference on Rewriting Techniques and Applications. RTA'91. Lecture Notes in Computer Science vol. 488 (1991), Springer-Verlag 112-123
11. Codish M., and Taboch C. A semantics basis for termination analysis of logic programs. Journal of Logic Programming 41 1 (1999) 103-123
12. Cousot P., and Cousot R. Abstract interpretation: A unifed lattice model for static analysis of programs by construction or approximation of fixpoints. Proc. of the 4th Symposium on Principles of Programming Languages. POPL'77 (1977), ACM 238-252
13. Cousot P., and Halbwachs N. Automatic discovery of linear restraints among variables of a program. Proc. of the 5th Symposium on Principles of Programming Languages. POPL'78 (1978), ACM 84-96
14. Dershowitz N. Termination of linear rewriting systems. Proc. of the 8th International Colloquium on Automata, Languages and Programming. ICALP'81. Lecture Notes in Computer Science vol. 115 (1981), Springer 448-458
15. Dershowitz N. Termination of rewriting. Journal of Symbolic Computation 3 1 & 2 (1987) 69-116
16. Drosten K. Termersetzungssysteme: Grundlagen der Prototyp-Generierung algebraischer Spezifikationen (1989), Springer Verlag, Berlin
17. Eén N., and Sörensson N. An extensible SAT-solver. In: Giunchiglia E., and Tacchella A. (Eds). Proc. of the 6th International Conference on Theory and Applications of Satisfiability Testing. SAT'03. Lecture Notes in Computer Science vol. 2919 (2004), Springer-Verlag 502-518
18. Gabbrielli M., and Giacobazzi R. Goal independency and call patterns in the analysis of logic programs. Proc. of the ACM Symposium on Applied Computing. SAC'94 (1994), ACM Press 394-399
19. Genaim S., and Codish M. Inferring termination condition for logic programs using backwards analysis. In: Nieuwenhuis R., and Voronkov A. (Eds). Proc. of Logic for Programming, Artificial intelligence and Reasoning. LPAR'01. Lecture Notes in Computer Science vol. 2250 (2001), Springer-Verlag 685-694
20. Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Deciding termination for ancestor match-bounded string rewriting systems, Technical Report, National Institute of Aerospace, Hampton, VA, 2004
21. Geser A., and Zantema H. Non-looping string rewriting. RAIRO Theoretical Informatics and Applications 33 (1999) 279-301
22. Giesl J., Schneider-Kamp P., and Thiemann R. AProVE 1.2: Automatic termination proofs in the dependency pair framework. In: Furbach U., and Shankar N. (Eds). Proc. of the 3rd International Joint Conference on Automated Reasoning. IJCAR'06. Lecture Notes in Artificial Intelligence vol. 4130 (2006), Springer-Verlag 281-286
23. Giesl J., Thiemann R., and Schneider-Kamp P. The dependency pair framework: Combining techniques for automated termination proofs. In: Baader F., and Voronkov A. (Eds). Proc. of the 11th International Conference on Logic for Programming, Artificial intelligence and Reasoning. LPAR'04. Lecture Notes in Artificial Intelligence vol. 3452 (2004), Springer-Verlag 210-220
24. Giesl J., Thiemann R., and Schneider-Kamp P. Proving and disproving termination of higher-order functions. In: Gramlich B. (Ed). Proc. of the 5th International Workshop on Frontiers of Combining Systems. FroCoS'05. Lecture Notes in Artificial Intelligence vol. 3717 (2005), Springer-Verlag 216-231
25. Giesl J., Thiemann R., Schneider-Kamp P., and Falke S. Automated termination proofs with AProVE. In: van Oostrom V. (Ed). Proc. of the 15th International Conference on Rewriting Techniques and Applications. RTA'04. Lecture Notes in Computer Science vol. 3091 (2004), Springer-Verlag 210-220
26. Guttag J.V., Kapur D., and Musser D.R. On proving uniform termination and restricted termination of rewriting systems. SIAM Journal of Computing 12 1 (1983) 189-214
27. Hanus M. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming 19-20 (1994) 583-628
28. Hirokawa N., and Middeldorp A. Tyrolean termination tool: Techniques and features. Information and Computation 205 4 (2007) 474-511
29. Hölldobler S. Foundations of Equational Logic Programming. Lecture Notes in Artificial Intelligence vol. 353 (1989), Springer, Berlin
30. Kapur D., Musser D.R., Narendran P., and Stillman J. Semi-unification. Theoretical Computer Science 81 (1991) 169-187
31. Winfried Kurth, Termination und konfluenz von semi-Thue-systemen mit nur einer regel, Ph.D. Thesis, Technische Universität Clausthal, Germany, 1990
32. D.S. Lankford, David R. Musser, A finite termination criterion, Unpublished Draft, USC Information Sciences Institute, Marina Del Rey, CA, 1978
33. Marché C., and Zantema H. The termination competition. In: Baader F. (Ed). Proc. of Term Rewriting and Applications, 18th International Conference. RTA'07. Lecture Notes in Computer Science vol. 4533 (2007), Springer-Verlag 303-313
34. Matchbox's web site. http://dfa.imn.htwk-leipzig.de/matchbox/
35. Mesnard F., and Bagnara R. cTI: A constraint-based termination inference tool for iso-prolog. Theory and Practice of Logic Programming 5 1-2 (2005) 243-257
36. Payet É. Detecting non-termination of term rewriting systems using an unfolding operator. In: Puebla G. (Ed). Proc. of the 16th International Symposium on Logic-based Program Synthesis and Transformation. LOPSTR'06. Lecture Notes in Computer Science vol. 4407 (2007), Springer-Verlag 194-209
37. Payet É., and Mesnard F. Non-termination inference for constraint logic programs. In: Giacobazzi R. (Ed). Proc. of the 11th International Symposium on Static Analysis. SAS'04. Lecture Notes in Computer Science vol. 3148 (2004), Springer-Verlag 377-392
38. Payet É., and Mesnard F. Non-termination inference of logic programs. ACM Transactions on Programming Languages and Systems 28 2 (2006) 256-289
39. Pettorossi A., and Proietti M. Rules and strategies for transforming functional and logic programs. ACM Computing Surveys 28 2 (1996) 360-414
40. Schmidt D.A. A calculus of logical relations for over- and underapproximating static analyses. Science of Computer Programming 64 1 (2007) 29-53
41. Steinbach J. Simplification orderings: History of results. Fundamenta Informaticae 24 (1995) 47-87
42. Tarski A. A lattice theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5 (1955) 285-310
43. Toyama Y. Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters 25 3 (1987) 141-143
44. TTT2's web site. http://colo6-c703.uibk.ac.at/ttt2
45. Waldmann J. Matchbox: A tool for match-bounded string rewriting. In: van Oostrom V. (Ed). Proc. of the 15th International Conference on Rewriting Techniques and Applications. RTA'04. Lecture Notes in Computer Science vol. 3091 (2004), Springer-Verlag 85-94
46. Johannes Waldmann, Compressed loops (draft). Available at: http://dfa.imn.htwk-leipzig.de/matchbox/methods/, 2007
47. Harald Zankl, Aart Middeldorp, Nontermination of string rewriting using SAT, in: Proc. of the 9th International Workshop on Termination, WST'07, 2007, pp. 52-55
48. Zantema H. Termination of string rewriting proved automatically. Journal of Automated Reasoning 34 2 (2005) 105-139