Abstract
Context-sensitive rewriting (CSR) is a simple restriction of rewriting which can be used e.g. for modelling non-eager evaluation in programming languages. Many times termination is a crucial property for program verification. Hence, developing tools for automatically proving termination of CSR is necessary.
All known methods for proving termination of (CSR) systems are based on transforming the CSR system \( \mathcal{R} \) into a (standard) rewrite system \( \mathcal{R}' \) whose termination implies the termination of the CSR system \( \mathcal{R} \).
In this paper first several negative results on the applicability of existing transformation methods are provided. Second, as a general-purpose way to overcome these problems, we develop the first (up to our knowledge) method for proving directly termination of context-sensitive rewrite systems: the context sensitive recursive path ordering (CSRPO).
Many interesting (realistic) examples that cannot be proved or are hard to prove with the known transformation methods are easily handled using CSRPO. Moreover, CSRPO is very suitable for automation.
C. Borralleras and A. Rubio are supported by the CICYT TIC2001-2476-C03-01, A. Rubio also by the DURSI group 2001SGR 00254 and S. Lucas by CICYT TIC2001-2705-C03-01, Acciones Integradas HI 2000-0161, HA 2001-0059, HU 2001-0019, and Generalitat ValencianaGV01-424.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133–178, 2000.
Thomas Arts and Hans Zantema. Termination of logic programs using semantic unification. Fifth International Workshop on Logic Program Synthesis and Transformation, LNCS 1048:219–233. Springer, 1996.
F. Baader and T. Nipkow. Term Rewriting and all that. Cambridge University Press, 1998.
C. Borralleras, S. Lucas and A. Rubio. Recursive Path Orderings can be Context-Sensitive. Available at http://www.lsi.upc.es/~albert/papers.html, 2002. Long version.
Max Dauchet. Simulation of turing machines by a regular rewrite rule. Theoretical Computer Science, 103(2):409–420, 1992.
Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279–301, 1982.
M.C.F. Ferreira and A.L. Ribeiro. Context-Sensitive AC-Rewriting. Proc. of 10th International Conference on Rewriting Techniques and Applications, LNCS 1631:286–300, Springer, 1999.
J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. Proc. of 10th International Conference on Rewriting Techniques and Applications, LNCS 1631:271–285, Springer, 1999.
J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. Proc. of 1th International Workshop on Rewriting Proof and Computation, RPC’01, pages 14–33, RIEC, Tohoku University, 2001.
Jean Goubault-Larrecq. Well-Founded Recursive Relations. Proc. 15th Int. Workshop Computer Science Logic, LNCS 2142:484–497, Springer, 2001.
Harald Ganzinger and Uwe Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. Proc. of 3rd International Workshop on Conditional Term Rewriting Systems, LNCS 656:113–127, Springer, 1993.
D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, 1970.
J. Kennaway and F.J. de Vries. Infinitary rewriting. In Term Rewriting Systems. Cambridge University Press, 2002. To appear.
S. Lucas. Termination of context-sensitive rewriting by rewriting. Proc. of 23rd. International Colloquium on Automata, Languages and Programming, ICALP’96, LNCS 1099:122–133, Springer, 1996.
S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1): 1–61, 1998.
S. Lucas. Termination of Rewriting With Strategy Annotations. Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LNAI 2250:669–684, Springer, 2001.
C. St. J. A. Nash-Williams. On well-quasi-ordering finite trees. Proceedings of the Cambridge Philosophical Society, 59(4):833–835, 1963.
J. Steinbach and H. Xi. Freezing — Termination Proofs for Classical, Context-Sensitive and Innermost Rewriting. Institut für Informatik, T.U. München, 1998.
H. Zantema. Termination of Context-Sensitive Rewriting. Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA’97, LNCS 1232:172–186, Springer, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borralleras, C., Lucas, S., Rubio, A. (2002). Recursive Path Orderings Can Be Context-Sensitive. In: Voronkov, A. (eds) Automated Deduction—CADE-18. CADE 2002. Lecture Notes in Computer Science(), vol 2392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45620-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-45620-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43931-8
Online ISBN: 978-3-540-45620-9
eBook Packages: Springer Book Archive