Context-sensitive dependency pairs

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

Volumn 4337 LNCS, Issue , 2006, Pages 297-308

  Alarcón, Beatriz ^a   Gutiérrez, Raúl ^a   Lucas, Salvador ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Dependency pairs; Program analysis; Term rewriting; Termination

Indexed keywords

CONTEXT SENSITIVE; CONTEXT SENSITIVE REWRITING; DEPENDENCY PAIRS; PROGRAM ANALYSIS; REWRITE SYSTEMS; STATE OF THE ART; TERM REWRITING; TERMINATION;

SOFTWARE ENGINEERING;

EID: 85025820092     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944836_28     Document Type: Conference Paper

References (20)

1. T. Arts and J. Giesl.Termination of Term Rewriting Using Dependency Pairs Theoretical Computer Science, 236:133-178, 2000.
2. B. Alarcón, R. Gutiérrez, J. Iborra, and S. Lucas. Proving Termination of Context-Sensitive Rewriting with MU-TERM. Electronic Notes in Theoretical Computer Science, to appear, 2007.
3. C. Borralleras, S. Lucas, and A. Rubio. Recursive Path Orderings can be Context-Sensitive. In Proc. of CADE’02, LNAI 23 92: 314-331, Springer-Verlag, Berlin, 2002.
4. F. Durán, S. Lucas, J. Meseguer, C. Marché, and X. Urbain. Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation, to appear, 2006.
5. J. Giesl, T. Arts, and E. Ohlebusch Modular Termination Proofs for Rewriting Using Dependency Pairs. Journal of Symbolic Computation 34(1):21-58, 2002.
6. B. Gramlich and S. Lucas. Simple termination of context-sensitive rewriting. In Proc. of RULE’02, pages 29-41, ACM Press, New York, 2002.
7. J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. In Proc. of RTA’99, LNCS 1631:271-285, Springer-Verlag, Berlin, 1999.
8. J. Giesl and A. Middeldorp. Transformation techniques for context-sensitive rewrite systems. Journal of Functional Programming, 14(4): 379-427, 2004.
9. J. Giesl, R. Thiemann, and P. Schneider-Kamp. The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. In Proc. of LPAR’04, LNCS 3452:301-331, Springer-Verlag, Berlin, 2004.
10. N. Hirokawa and A. Middeldorp. Dependency Pairs Revisited. In Proc. of RTA’04, LNCS 3091: 249-268, Springer-Verlag, Berlin, 2004.
11. N. Hirokawa and A. Middeldorp.Automating the dependency pair method. Information and Computation, 199:172-199, 2005.
12. S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1):1-61, January1998.
13. S. Lucas. Context-sensitive rewriting strategies. Information and Computation, 178(1):293-343, 2002.
14. ∼slucas/csr/termination/muterm.
15. S. Lucas. Polynomials for proving termination of context-sensitive rewriting. In Proc. of FOSSACS’04, LNCS 2987:318-332, Springer-Verlag, Berlin2004.
16. S. Lucas. Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications, 39(3):547-586, 2005.
17. S. Lucas. Proving termination of context-sensitive rewriting by transformation. Information and Computation, to appear 2006.
18. E. Ohlebusch. Advanced Topics in Term Rewriting. Springer-Verlag, Berlin, 2002.
19. Te Re Se, editor, Term Rewriting Systems, Cambridge University Press, 2003.
20. H. Zantema. Termination of Context-Sensitive Rewriting. In Proc. of RTA’97, LNCS 1232:172-186, Springer-Verlag, Berlin, 1997.