Modular and incremental proofs of AC-termination

Journal of Symbolic Computation

Volumn 38, Issue 1, 2004, Pages 873-897

  Marché, Claude ^a   Urbain, Xavier ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Automation; Modularity; Rewriting; Termination

Indexed keywords

EID: 3042538966     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2004.02.003     Document Type: Article

References (46)

1. Arts, T., Giesl, J., 1997. Automatically proving termination where simplification orderings fail. In: Bidoit, M., Dauchet, M. (Eds.), Theory and Practice of Software Development. Lecture Notes in Computer Science, vol. 1214. Springer-Verlag, Lille, France.
2. Arts, T., Giesl, J., 2000. Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133-178.
3. Baader, F., Nipkow, T., 1998. Term Rewriting and All That. Cambridge University Press.
4. Bachmair, L., Plaisted, D.A., 1985. Termination orderings for associative-commutative rewriting systems. Journal of Symbolic Computation 1 (4), 329-349.
5. Ben Cherifa, A., Lescanne, P., 1987. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming 9, 137-159.
6. Borralleras, C., Rubio, A., 2003. Monotonic AC-compatible semantic path orderings. In: Nieuwenhuis, R. (Ed.), 14th International Conference on Rewriting Techniques and Applications, Valencia, Spain, June, 2003. Lecture Notes in Computer Science, vol. 2706. Springer-Verlag.
7. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F., 2002. Maude: Specification and programming in rewriting logic. Theoretical Computer Science 285 (2), 187-243.
8. Contejean, E., Marché, C., Monate, B., Urbain, X., 2003. Proving termination of rewriting with Ci ME. In: Rubio, A. (Ed.), Extended Abstracts of the 6th International Workshop on Termination, WST'03, June, 2003. pp. 71-73. http://cime.1ri.fr.
9. Contejean, E., Marché, C., Rabehasaina, L., 1997. Rewrite systems for natural, integral, and rational arithmetic. In: Comon, H. (Ed.), 8th International Conference on Rewriting Techniques and Applications, Barcelona, Spain, June, 1997. Lecture Notes in Computer Science, vol. 1232. Springer-Verlag.
10. Delor, C., Puel, L., 1993. Extension of the associative path ordering to a chain of associative-commutative symbols. In: Kirchner, C. (Ed.), 5th International Conference on Rewriting Techniques and Applications, Montreal, Canada, June, 1993. Lecture Notes in Computer Science, vol. 690. Springer-Verlag, pp. 389-404.
11. Deplagne, É, 2000. Sequent Calculus Viewed Modulo. In: Piliére, Catherine (Ed.), Proceedings of the Fifth ESSLLI Student Session. University of Birmingham, pp. 66-76.
12. Dershowitz, N., 1987. Termination of rewriting. Journal of Symbolic Computation 3 (1), 69-115.
13. Dershowitz, N., 1995. Hierarchical termination. In: Dershowitz, N., Lindenstrauss, N. (Eds.), Proceedings of the Fourth International Workshop on Conditional and Typed Rewriting Systems, Jerusalem, Israel, July, 1994, vol. 968. Springer-Verlag, Berlin, pp. 89-105.
14. Dershowitz, N., Jouannaud, J.-P., 1990. Rewrite systems. In: van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, vol. B. North-Holland, pp. 243-320.
15. Fernández, M., Jouannaud, J.-P., 1995. Modular termination of term rewriting systems revisited. In: Astesiano, E., Reggio, G., Tarlecki, A. (Eds.), Recent Trends in Data Type Specification. Lecture notes in Computer Science, vol. 906. Springer-Verlag, pp. 255-272 (refereed selection of papers presented at ADT'94).
16. Giesl, J., Arts, T., Ohlebusch, E., 2002. Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation 34 (2), 21-58.
17. Giesl, J., Kapur, D., 2001. Dependency pairs for equational rewriting. In: Middeldorp, A. (Ed.), 12th International Conference on Rewriting Techniques and Applications, Utrecht, The Netherlands, May, 2001. Lecture Notes in Computer Science, vol. 2051. Springer-Verlag, pp. 93-108.
18. Goguen, J.A., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.-P., 2000. Introducing OBJ*. In: Software Engineering with OBJ: Algebraic Specification in Action. Kluwers Academic Publishers.
19. Gramlich, B., 1994. Generalized sufficient conditions for modular termination of rewriting. Applicable Algebra in Engineering, Communication and Computing 5, 131-158.
20. Gramlich, B., Lucas, S., 2002. Modular termination of context-sensitive rewriting. In: Kirchner, C. (Ed.), Proc. of 4th ACM Sigplan Conference on Principles and Practice of Declarative Programming, PPDP'02, Pittsburgh, USA, October, 2002. ACM Press, New York, pp. 50-61.
21. Jouannaud, J.-P., Kirchner, H., 1986. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing 15 (4), 1155-1194.
22. Kapur, D., Sivakumar, G., 1997. A total, ground path ordering for proving termination of AC-rewrite systems. In: Comon, H. (Ed.), 8th International Conference on Rewriting Techniques and Applications, Barcelona, Spain, June, 1997. Lecture Notes in Computer Science, vol. 1232. Springer-Verlag.
23. Kapur, D., Sivakumar, G., 2000. Proving associative-commutative termination using RPO-compatible orderings. In: Caferra, R., Salzer, G. (Eds.), Automated Deduction in Classical and Non-Classical Logics. Lecture Notes in Artificial Intelligence, vol. 1761. Springer-Verlag, pp. 40-62.
24. Krishna Rao, M.R.K., 1994. Simple termination of hierarchical combinations of term rewriting systems. In: Theoretical Aspects of Computer Software. Lecture Notes in Computer Science, vol. 789. Springer-Verlag, pp. 203-223.
25. Krishna Rao, M.R.K., 1995. Modular proofs for completeness of hierarchical term rewriting systems. Theoretical Computer Science 151, 487-512.
26. Kurihara, M., Ohuchi, A., 1990. Modularity of simple termination of term rewriting systems. Journal of Information Processing Society, Japan 34, 632-642.
27. Kurihara, M., Ohuchi, A., 1992. Modularity of simple termination of term rewriting systems with shared constructors. Theoretical Computer Science 103, 273-282.
28. Kurihara, M., Ohuchi, A., 1995. Decomposable termination of composable term rewriting systems. IEICE E78-D (4), 314-320.
29. Kusakari, K., Marché, C., Urbain, X., 2002. Termination of associative-commutative rewriting using dependency pairs criteria. Research Report 1304, LRI. http://www.1ri.fr/~urbain/textes/rr1304.ps.gz.
30. Kusakari, K., Nakamura, M., Toyama, Y., 1999. Argument filtering transformation. In: Nadathur, G. (Ed.), Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, 1999. Lecture Notes in Computer Science, vol. 1702. Springer-Verlag, pp. 47-61.
31. Kusakari, K., Toyama, Y., 2001. On proving AC-termination by AC-dependency pairs. IEICE Transactions on Information and Systems E84-D (5), 604-612.
32. Lucas, S., 2002. Context-sensitive rewriting strategies. Information and Computation 178 (1), 294-343.
33. Marché, C., 1996. Normalized rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation 21 (3), 253-288.
34. Marché, C., Urbain, X., 1998. Termination of associative-commutative rewriting by dependency pairs. In: Nipkow, T. (Ed.), 9th International Conference on Rewriting Techniques and Applications, Tsukuba, Japan, April, 1998. Lecture Notes in Computer Science, vol. 1379. Springer-Verlag, pp. 241-255.
35. Middeldorp, A., Toyama, Y., 1993. Completeness of combinations of constructor systems. Journal of Symbolic Computation 15, 331-348.
36. Ohlebusch, E., 1994. On the modularity of termination of term rewriting systems. Theoretical Computer Science 136, 333-360.
37. Ohlebusch, E., 1995. Modular properties of composable term rewriting systems. Journal of Symbolic Computation 20, 1-41.
38. Ohlebusch, E., 2002a. Advanced Topics in Term Rewriting. Springer-Verlag.
39. Ohlebusch, E., 2002b. Hierarchical termination revisited. Information Processing Letters 84 (4), 207-214.
40. Peterson, G.E., Stickel, M.E., 1981. Complete sets of reductions for some equational theories. Journal of ACM 28 (2), 233-264.
41. Rubio, A., 1999. A fully syntactic AC-RPO. In: Narendran, P., Rusinowitch, M. (Eds.), 10th International Conference on Rewriting Techniques and Applications, Trento, Italy, July, 1999. Lecture Notes in Computer Science, vol. 1631. Springer-Verlag.
42. Sakai, M., Kusakari, K., 2001. On new dependency pair method for proving termination of higher-order rewrite systems. In: International Workshop on Rewriting in Proof and Computation, RPC'01, Sendai, Japan, October, 2001. pp. 176-187. http://www.sakabe.nuie.nagoya-u.ac.jp/~sakai/papers/rpc01a.pdf.
43. Toyama, Y., 1987. Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters 25, 141-143.
44. Urbain, X., 2001a. Approche incrémentale des preuves automatiques de terminaison. Thèse de doctorat, Université Paris-Sud, Orsay, France, October, 2001. http://www.1ri.fr/~urbain/textes/these.ps.gz.
45. Urbain, X., 2001b. Automated incremental termination proofs for hierarchically defined term rewriting systems. In: Goré, R., Leitsch, A., Nipkow, T. (Eds.), International Joint Conference on Automated Reasoning, Siena, Italy, June, 2001. Lecture Notes in Artificial Intelligence, vol. 2083. Springer-Verlag, pp. 485-498.
46. Urbain, X., 2004. Modular and incremental automated termination proofs. Journal of Automated Reasoning.