Proving termination of context-sensitive rewriting by transformation

Information and Computation

Volumn 204, Issue 12, 2006, Pages 1782-1846

  Lucas, Salvador ^a  

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

Author keywords

Context sensitive rewriting; Program analysis; Term rewriting; Termination; Transformations

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION SYSTEMS; MATHEMATICAL TRANSFORMATIONS;

CONTEXT SENSITIVE REWRITING; EXPERIMENTAL EVALUATION; PRACTICAL USE; PROGRAM ANALYSIS; TERM REWRITING; TERM REWRITING SYSTEMS; TERMINATION; TERMINATION PROBLEMS;

PROBLEM ORIENTED LANGUAGES;

EID: 84855200272     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.07.001     Document Type: Article

References (66)

1. B. Alarcón, R. Gutiérrez, J. Iborra, S. Lucas, Proving Termination of Context-Sensitive Rewriting with MU-TERM, in: Electronic Notes in Theoretical Computer Science, 2007 (to appear).
2. M. Alpuente, S. Escobar, B. Gramlich, S. Lucas, Improving on-demand strategy annotations, in: M. Baaz, A. Voronkov (Eds.), Proc. 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR'02, LNAI, vol. 2514, Springer, Berlin, 2002, pp. 1-18.
3. M. Alpuente, S. Escobar, S. Lucas, Correct and complete (positive) strategy annotations for OBJ, in: F. Gadducci, U. Montanari (Eds.), Proc. of the 4th International Workshop on Rewriting Logic and its Applications, WRLA'02, Electronic Notes in Theoretical Computer Science, Vol. 71, 2004.
4. T. Arts, J. Giesl, Termination of term rewriting using dependency pairs, Theoretical Computer Science 236(2000) 133-178.
5. F. Baader, T. Nipkow, Term Rewriting and All That, Cambridge University Press, 1998.
6. C. Borralleras, Ordering-based methods for proving termination automatically, PhD Thesis, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, May 2003.
7. C. Borralleras, S. Lucas, A. Rubio, Recursive path orderings can be context-sensitive, in: A. Voronkov (Ed.), Proc. of 18th International Conference on Automated Deduction, CADE'02, LNAI, vol. 2392, Springer-Verlag, Berlin, 2002, pp. 314-331.
8. A. Bouhoula, J.-P. Jouannaud, J. Meseguer, Specification and proof in membership equational logic, Theoretical Computer Science 236(2000) 35-132.
9. R. Bruni, J. Meseguer, Generalized Rewrite Theories, in: J. C. M. Baeten, J. K. Lenstra, J. Parrow, G. J. Woeginger (Eds.), Proc. of 30th International Colloquium on Automata, Languages and Programming, ICALP'03, Lecture Notes in Computer Science, vol. 2719, Springer-Verlag, Berlin, 2003, pp. 252-266.
10. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, J. Quesada, Maude: specification and programming in rewriting logic, Theoretical Computer Science 285(2) (2002) 187-243. (Pubitemid 34862893)
11. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, C. Talcott, The Maude 2.0 System, in: R. Nieuwenhuis (Ed.), Proc. of 14th International Conference on Rewriting Techniques and Applications, RTA'03, Lecture Notes in Computer Science, vol. 2706, Springer, 2003, pp. 76-87. (Pubitemid 36768714)
12. E. Contejean, C. Marché, B. Monate, X. Urbain, Proving termination of rewriting with CiME, in: A. Rubio (Ed.), Proc. of 6th International Workshop on Termination, WST'03, Technical Report DSIC II/15/03, Valencia, Spain, 2003, pp. 71-73. Available at: http://cime.lri.fr.
13. N. Dershowitz, A note on simplification orderings, Information Processing Letters 9(5) (1979) 212-215.
14. N. Dershowitz, Orderings for term rewriting systems, Theoretical Computer Science 17(3) (1982) 279-301.
15. N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation 3(1987) 69-115.
16. F. Durán, S. Escobar, S. Lucas, New evaluation commands for Maude within Full Maude, N. Martí-Oliet (Ed.), Proc. of the 5th International Workshop on Rewriting Logic and its Applications, WRLA'04 (special issue), Electronic Notes in Theoretical Computer Science vol. 117(2005) 263-284. (Pubitemid 40135556)
17. F. Durán, S. Lucas, J. Meseguer, C. Marché, X. Urbain, Proving termination of membership equational programs, in: P. Sestoft, N. Heintze (Eds.), Proc. of ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation, PEPM'04, ACM Press, New York, 2004, pp. 147-158. (Pubitemid 40061967)
18. F. Durán, S. Lucas, J. Meseguer, C. Marché, X. Urbain, Proving Operational Termination of Membership Equational Programs, Higher-Order and Symbolic Computation, 2006 (to appear).
19. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science volume B: Formal Models and Semantics, Elsevier, Amsterdam and The MIT Press, Cambridge, MA, 1990, pp. 243-320.
20. N. Dershowitz, S. Kaplan, D. Plaisted, Rewrite, rewrite, rewrite, rewrite, rewrite, Theoretical Computer Science 83(1991) 71-96. (Pubitemid 21677686)
21. M.-L. Fernández, Relaxing monotonicity for innermost termination, Information Processing Letters 93(2005) 117-123.
22. M. C. F. Ferreira, A. L. Ribeiro, Context-sensitive AC-rewriting, in: P. Narendran, M. Rusinowitch (Eds.), Proc. of 10th International Conference on Rewriting Techniques and Applications, RTA'99, Lecture Notes in Computer Science, vol. 1631, Springer-Verlag, Berlin, 1999, pp. 286-300.
23. O. Fissore, I. Gnaedig, H. Kirchner, Simplification and termination of strategies in rule-based languages, in: Proc. of 5th ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'03, ACM Press, 2003, pp. 124-135.
24. W. Fokkink, J. Kamperman, P. Walters, Lazy rewriting on eager machinery, ACM Transactions on Programming Languages and Systems 22(1) (2000) 45-86.
25. K. Futatsugi, J. Goguen, J.-P. Jouannaud, J. Meseguer, Principles of OBJ2, in: Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL'85, ACM Press, 1985, pp. 52-66.
26. K. Futatsugi, A. Nakagawa, An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specification over networks, in: Proc. of 1st International Conference on Formal Engineering Methods, 1997..
27. J. Giesl, T. Arts, E. Ohlebusch, Modular termination proofs for rewriting using dependency pairs, Journal of Symbolic Computation 34(1) (2002) 21-58.
28. J. Giesl, A. Middeldorp, Transforming Context-Sensitive Rewrite Systems, in: P. Narendran, M. Rusinowitch (Eds.), Proc. of 10th International Conference on Rewriting Techniques and Applications, RTA'99, Lecture Notes in Computer Science, vol. 1631, Springer-Verlag, Berlin, 1999, pp. 271-285.
29. J. Giesl, A. Middeldorp, Transformation techniques for context-sensitive rewrite systems, Journal of Functional Programming 14(4) (2004) 379-427. (Pubitemid 38874712)
30. J. Giesl, R. Thiemann, P. Schneider-Kamp, The dependency pair framework: combining techniques for automated termination proofs, in: F. Baader, A. Voronkov (Eds.), Proc. of 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR'04, Lecture Notes in Computer Science, vol. 3452, Springer-Verlag, Berlin, 2004, pp. 301-331.
31. J. Giesl, R. Thiemann, P. Schneider-Kamp, S. Falke, Automated termination proofs with AProVE, in: V. van Oostrom (Ed.), Proc. of 15h International Conference on Rewriting Techniques and Applications, RTA'04, Lecture Notes in Computer Science, Vol. 3091, Springer-Verlag, Berlin, 2004, pp. 210-220 http://www-i2.informatik.rwth-aachen. de/AProVE.
32. J. A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, J.-P. Jouannaud, Introducing OBJ, in: J. Goguen, G. Malcolm (Eds.), Software Engineering with OBJ: Algebraic Specification in Action, Kluwer, 2000.
33. B. Gramlich, Generalized sufficient conditions for modular termination of rewriting, Applicable Algebra in Engineering, Communication and Computing 5(1994) 131-158.
34. B. Gramlich, S. Lucas, Modular termination of context-sensitive rewriting, in: C. Kirchner (Ed.), Proc. of 4th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'02, ACM Press, New York, 2002, pp. 50-61.
35. B. Gramlich, S. Lucas, Simple termination of context-sensitive rewriting, in: B. Fischer, E. Visser (Eds.), Proc. of 3rd ACM SIGPLAN Workshop on Rule-Based Programming, RULE'02, ACM Press, New York, 2002, pp. 29-41.
36. B. Gramlich, S. Lucas, Modular and Simple termination of context-sensitive rewriting, 2006 (in preparation).
37. N. Hirokawa, A. Middeldorp, Dependency pairs revisited, in: V. van Oostrom (Ed.), Proc. of 15th International Conference on Rewriting Techniques and Applications, RTA'04, Lecture Notes in Computer Science, vol. 3091, Springer-Verlag, Berlin, 2004, pp. 249-268.
38. N. Hirokawa, A. Middeldorp, Polynomial interpretations with negative coefficients, in: B. Buchberger, J. A. Campbell (Eds.), Proc. of the 7th International Conference on Artificial Intelligence and Symbolic Computation, AISC'04, LNAI, vol. 3249, Springer-Verlag, Berlin, 2004, pp. 185-198.
39. N. Hirokawa, A. Middeldorp, Tyrolean termination tool, in: J. Giesl (Ed.), Proc. of 16th International Conference on Rewriting Techniques and Applications, RTA'05, Lecture Notes in Computer Science, vol. 3467, 2005, pp. 175-184. (Pubitemid 41313356)
40. P. Hudak, S. J. Peyton-Jones, P. Wadler, Report on the Functional Programming Language Haskell: a non-strict, purely functional language, Sigplan Notices 27(5) (1992) 1-164.
41. G. Huet, D. S. Lankford, On the uniform halting problem for term rewriting systems, Research Report 283, INRIA, March 1978.
42. R. Kennaway, J. W. Klop, M. R. Sleep, F.-J. de Vries, Transfinite reductions in orthogonal term rewriting systems, Information and Computation 119(1) (1995) 18-38.
43. R. Kennaway, J. W. Klop, M. R. Sleep, F.-J. de Vries, Meaningless terms in rewriting, Journal of Functional and Logic Programming 1999(1) (1999).
44. D. E. Knuth, P. E. Bendix, Simple word problems in universal algebra, in: J. Leech (Ed.), Computational Problems in abstact Algebra, Pergamon Press, New York, 1970, pp. 263-297.
45. D. S. Lankford, On proving term rewriting systems are noetherian, Technical Report, Louisiana Technological University, Ruston, LA, 1979.
46. S. Lucas, Termination of context-sensitive rewriting by rewriting, in: F. Meyer auf der Heide, B. Monien (Eds.), Proc. of 23rd. International Colloquium on Automata, Languages and Programming, ICALP'96, Lecture Notes in Computer Science, vol. 1099, Springer-Verlag, Berlin, 1996, pp. 122-133. (Pubitemid 126097561)
47. S. Lucas, Context-sensitive computations in functional and functional logic programs, Journal of Functional and Logic Programming 1998(1) (1998) 1-61.
48. S. Lucas, Termination of rewriting with strategy annotations, in: R. Nieuwenhuis, A. Voronkov (Eds.), Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR'01, LNAI, vol. 2250, Springer-Verlag, Berlin, 2001, pp. 669-684. (Pubitemid 33373284)
49. S. Lucas, Termination of on-demand rewriting and termination of OBJ programs, in: Proc. of 3rd International Conference on Principles and Practice of Declarative Programming, PPDP'01, ACM Press, 2001, pp. 82-93.
50. S. Lucas, Context-sensitive rewriting strategies, Information and Computation 178(1) (2002) 293-343.
51. S. Lucas, Lazy rewriting and context-sensitive rewriting, Electronic Notes in Theoretical Computer Science, Elsevier Science, 2002.
52. S. Lucas, Termination of programswith strategy annotations, Technical Report DSIC II/20/03, Universidad Politécnica de Valencia, Sep. 2003.
53. S. Lucas, MU-TERM: A Tool for Proving Termination of Context-Sensitive Rewriting, in: V. van Oostrom (Ed.), Proc. of 15th International Conference on Rewriting Techniques and Applications, RTA'04, Lecture Notes in Computer Science, vol. 3091, Springer-Verlag, Berlin, 2004, pp. 200-209 .
54. S. Lucas, Polynomials for proving termination of context-sensitive rewriting, in: I. Walukiewicz (Ed.), Proc. of 7th International Conference on Foundations of Software Science and Computation Structures, FOSSACS'04, Lecture Notes in Computer Science, vol. 2987, Springer-Verlag, Berlin, 2004, pp. 318-332.
55. S. Lucas, Polynomials over the reals in proofs of termination: from theory to practice, RAIRO Theoretical Informatics and Applications 39(3) (2005) 547-586. (Pubitemid 41048020)
56. J. McCarthy, Recursive Functions of Symbolic Expressions and their Computations by Machine, Part I, Communications of the ACM 3(4) (1960) 184-195.
57. A. Middeldorp, Call by need computations to root-stable form, in: Conference Record of the 24th Annual ACM Symposium on Principles of Programming Languages, POPL'97, ACM Press, 1997, pp. 94-105.
58. A. Middeldorp, B. Gramlich, Simple termination is difficult, Applicable Algebra in Engineering, Communication and Computing 6(1995) 115-128.
59. E. G. J. M. H. Nöcker, J. E. W. Smetsers, M. C. J. D. van Eekelen, M. J. Plasmeijer, Concurrent clean, in: E. H. L. Aarts, J. Leeuwen, M. Rem (Eds.), Proc. of Parallel Architectures and Languages Europe, PARLE'91, Lecture Notes in Computer Science, vol. 506, Springer-Verlag, Berlin, 1992, pp. 202-219.
60. E. Ohlebusch, Advanced Topics in Term Rewriting, Springer-Verlag, Berlin, 2002.
61. J. Steinbach, Simplification orderings: history of results, Fundamenta Informaticae 24(1995) 47-88.
62. TeReSe, editor, Term Rewriting Systems, Cambridge University Press, 2003.
63. X. Urbain, Modular and incremental automated termination proofs, Journal of Automated Reasoning 32(4) (2004) 315-355.
64. J. Waldmann, Matchbox: a tool for match-bounded string rewriting, in: V. van Oostrom (Ed.), Proc. of 15th International Conference on Rewriting Techniques and Applications, RTA'04, Lecture Notes in Computer Science, vol. 3091, Springer-Verlag, Berlin, 2004, pp. 85-94.
65. H. Zantema, Termination of context-sensitive rewriting, in: H. Comon (Ed.), Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA'97, Lecture Notesin Computer Science, Vol. 1232, Springer-Verlag, Berlin, 1997, pp. 172-186. (Pubitemid 127105918)
66. H. Zantema, Termination, in: TeReSe (Ed.), Term Rewriting Systems, Cambridge University Press, 2003.