Proving Termination of Context-Sensitive Rewriting with MU-TERM

Electronic Notes in Theoretical Computer Science

Volumn 188, Issue , 2007, Pages 105-115

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

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

Author keywords

Context sensitive rewriting; program analysis; term rewriting; termination

Indexed keywords

CONTEXT-SENSITIVE REWRITING; PROGRAM ANALYSIS; TERM REWRITING; TERMINATION;

COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; PROBLEM SOLVING;

CONTEXT SENSITIVE LANGUAGES;

EID: 34447275698     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.05.041     Document Type: Article

References (27)

1. Arts T., and Giesl J. Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236 (2000) 133-178
2. Alarcón B., Gutiérrez R., and Lucas S. Context-Sensitive Dependency Pairs. In: Garg N., and Arun-Kumar S. (Eds). Proc. of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS'06. LNCS 4337 (2006), Springer-Verlag, Berlin 297-308
3. Alarcón B., and Lucas S. Building .NET GUIs for Haskell applications. Proc. of .NET'06 (2006), University of West-Bohemia 57-66
4. Borralleras C., Lucas S., and Rubio A. Recursive Path Orderings can be Context-Sensitive. In: Voronkov A. (Ed). Proc. of 18th International Conference on Automated Deduction. CADE'02. LNAI 2392 (2002), Springer-Verlag, Berlin 314-331
5. Codish M., Lagoon V., and Stuckey P. Solving Partial Order Constraints for LPO Termination. In: Pfenning F. (Ed). Proc. of 17th International Conference on Rewriting Techniques and Applications. RTA'06. LNCS 4098 (2006)
6. Contejean E., Marché C., Tomás A.-P., and Urbain X. Mechanically proving termination using polynomial interpretations. Journal of Automated Reasoning 32 4 (2006) 315-355
7. Dershowitz N. Orderings for term rewriting systems. Theoretical Computer Science 17 3 (1982) 279-301
8. Durán F., Lucas S., Meseguer J., Marché C., and Urbain X. Proving Termination of Membership Equational Programs. In: Sestoft P., and Heintze N. (Eds). Proc. of ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation. PEPM'04 (2004), ACM Press, New York 147-158
9. 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, 2007
10. Gramlich B., and Lucas S. Modular termination of context-sensitive rewriting. In: Kirchner C. (Ed). Proc. of 4th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming. PPDP'02 (2002), ACM Press, New York 50-61
11. Gramlich B., and Lucas S. Simple termination of context-sensitive rewriting. In: Fischer B., and Visser E. (Eds). Proc. of 3rd ACM SIGPLAN Workshop on Rule-Based Programming. RULE'02 (2002), ACM Press, New York 29-41
12. Giesl J., and Middeldorp A. Transforming Context-Sensitive Rewrite Systems. In: Narendran P., and Rusinowitch M. (Eds). Proc. of 10th International Conference on Rewriting Techniques and Applications. RTA'99. LNCS 1631 (1999), Springer-Verlag, Berlin 271-285
13. Giesl J., and Middeldorp A. Transformation techniques for context-sensitive rewrite systems. Journal of Functional Programming 14 4 (2004) 379-427
14. 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 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. LPAR'04. LNCS 3452 (2004), Springer-Verlag, Berlin 301-331
15. 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 Third International Joint Conference on Automated Reasoning. IJCAR'06. LNAI 4130 (2006), Springer-Verlag, Berlin 281-286. http://www-i2.informatik.rwth-aachen.de/AProVE Available at
16. Hirokawa N., and Middeldorp A. Tyrolean Termination Tool. In: Giesl J. (Ed). Proc. of 16th International Conference on Rewriting Techniques and Applications. RTA'05. LNCS 3467 (2005) 175-184
17. Lucas S. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1998 1 (January 1998) 1-61
18. Lucas S. Context-sensitive rewriting strategies. Information and Computation 178 1 (2002) 293-343
19. Lucas S. MU-TERM: A Tool for Proving Termination of Context-Sensitive Rewriting. In: van Oostrom V. (Ed). Proc. of 15h International Conference on Rewriting Techniques and Applications. RTA'04. LNCS 3091 (2004), Springer-Verlag, Berlin 200-209
20. Lucas S. Polynomials for proving termination of context-sensitive rewriting. In: Walukiewicz I. (Ed). Proc. of 7th International Conference on Foundations of Software Science and Computation Structures. FOSSACS'04. LNCS 2987 (2004), Springer-Verlag 318-332
21. Lucas S. Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications 39 3 (2005) 547-586
22. Lucas S. Proving termination of context-sensitive rewriting by transformation. Information and Computation 204 12 (2006) 1782-1846
23. Lucas S. On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting. Applicable Algebra in Engineering, Communication and Computing 17 1 (2006) 49-73
24. Ohlebusch E. Advanced Topics in Term Rewriting (2002), Springer-Verlag, Berlin
25. Tarski A. A Decision Method for Elementary Algebra and Geometry. Second Edition (1951), University of California Press, Berkeley
26. Zantema H. Termination of Context-Sensitive Rewriting. In: Comon H. (Ed). Proc. of 8th International Conference on Rewriting Techniques and Applications. RTA'97. LNCS 1232 (1997), Springer-Verlag, Berlin 172-186
27. Zantema H. TORPA: Termination of String Rewriting Systems. Journal of Automated Reasoning 34 (2006) 105-39