Detecting non-termination of term rewriting systems using an unfolding operator

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

Volumn 4407 LNCS, Issue , 2007, Pages 194-209

  Payet, Étienne ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC DESIGN; PROBLEM SOLVING;

TERM REWRITING SYSTEMS; UNFOLDING OPERATORS;

LOGIC PROGRAMMING;

EID: 34548066860     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-71410-1_14     Document Type: Conference Paper

References (25)

1. M. Alpuente, M. Falaschi, and F. Manzo. Analyses of unsatisfiability for equational logic programming. Journal of Logic Programming, 311(1-3):479-525, 1995.
2. M. Alpuente, M. Falaschi, G. Moreno, and G. Vidal. Safe folding/unfolding with conditional narrowing. In Proc. of ALP/HOA 97, pages 1-15, 1997.
3. M. Alpuente, M. Falaschi, G. Moreno, and G. Vidal. Rules + strategies for transforming lazy functional logic programs. Theoretical Computer Science, 311 (1-3):479-525, 2004.
4. M. Alpuente, M. Falaschi, M. J. Ramis, and G. Vidal. Narrowing approximations as an optimization for equational logic programs. In Proc. of PLILP 1993, pages 391-409, 1993.
5. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
6. F. Baader and T. Nipkow. Term rewriting and all that. Cambridge, 1998.
7. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44-67, 1977.
8. J. Chabin and P. Réty. Narrowing directed by a graph of terms. In G. Goos and J. Hartmanis, editors, Proc. of RTA'91, volume 488 of LNCS, pages 112-123. Springer-Verlag, Berlin, 1991.
9. M. Codish and C. Taboch. A semantic basis for the termination analysis of logic programs. Journal of Logic Programming, 41(1):103-123, 1999.
10. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3 (1 & 2):69-116, 1987.
11. K. Drosten. Termersetzungssysteme: Grundlagen der Prototyp-Generierung algebraischer Spezifikationen. Springer Verlag, Berlin, 1989.
12. M. Gabbrielli and R. Giacobazzi. Goal independency and call patterns in the analysis of logic programs. In Proc. of SAC'94, pages 394-399. ACM Press, 1994.
13. S. Genaim and M. Codish. Inferring termination conditions for logic programs using backwards analysis. In R. Nieuwenhuis and A. Voronkov, editors, Proc. of LPAR'01, volume 2250 of LNCS, pages 685-694. Springer-Verlag, Berlin, 2001.
14. J. Giesl, R. Thiemann, and P. Schneider-Kamp. The dependency pair framework: combining techniques for automated termination proofs. In F. Baader and A. Voronkov, editors, Proc. of LPAR'04, volume 3452 of LNAI, pages 210-220. Springer-Verlag, 2004.
15. J. Giesl, R. Thiemann, and P. Schneider-Kamp. Proving and disproving termination of higher-order functions. In B. Gramlich, editor, Proc. of FroCoS'05, volume 3717 of LNAI, pages 216-231. Springer-Verlag, 2005.
16. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In V. van Oostrom, editor, Proc. of RTA '04, volume 3091 of LNCS, pages 210-220. Springer-Verlag, 2004.
17. D. Kapur, D. Musser, P. Narendran, and J. Stillman. Semi-unification. Theoretical Computer Science, 81:169-187, 1991.
18. D.S. Lankford and D.R. Musser. A finite termination criterion. Unpublished Draft, USC Information Sciences Institute, Marina Del Rey, CA, 1978.
19. F. Mesnard and R. Bagnara. cTI: a constraint-based termination inference tool for iso-prolog. Theory and Practice of Logic Programming, 5(1-2):243-257, 2005.
20. E. Payet and F. Mesnard. Non-termination inference for constraint logic programs. In R. Giacobazzi, editor, Proc. of SAS'04, volume 3148 of LNCS, pages 377-392. Springer-Verlag, 2004.
21. E. Payet and F. Mesnard. Non-termination inference of logic programs. ACM Transactions on Programming Languages and Systems, 28, Issue 2:256-289, 2006.
22. A. Pettorossi and M. Proietti. Rules and strategies for transforming functional and logic programs. ACM Comput. Surv., 28(2):360-414, 1996.
23. J. Steinbach. Simplification orderings: history of results. Fundamenta Informaticae, 24:47-87, 1995.
24. Y. Toyama. Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25(3):141-143, 1987.
25. Termination Problem Data Base, http://www.lri.fr/~marche/termination- competition/