Abstract
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far in tools for automatic termination proving and variants with infinite sets of labels were considered not to be suitable for automation. We show that such automation can be achieved for semantic labelling with natural numbers, in combination with recursive path ordering (RPO). In order to do so we developed algorithms to deal with recursive path ordering for these infinite labelled systems. Using these techniques TPA, a tool developed by the first author, is the only current tool that can prove termination of the SUBST system automatically.
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.
Similar content being viewed by others
References
The termination competition, http://www.lri.fr/~marche/termination-competition
Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
Cherifa, A.B., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Sci. Comput. Program. 9(2), 137–159 (1987)
Curien, P.-L., Hardin, T., Ríos, A.: Strong normalization of substitutions. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 209–217. Springer, Heidelberg (1992)
Dershowitz, N.: Orderings for term-rewriting systems. Theor. Comput. Sci. 17, 279–301 (1982)
Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 210–220. Springer, Heidelberg (2004)
Hardin, T., Laville, A.: Proof of termination of the rewriting system SUBST on CCL. Theor. Comput. Sci. 46(2-3), 305–312 (1986)
Hirokawa, N., Middeldorp, A.: Predictive labeling. In: Pfenning, F. (ed.) Proceedings of the 17th Conference on Rewriting Techniques and Applications (RTA). LNCS, Springer, Heidelberg (2006)
Hong, H., Jakus, D.: Testing Positiveness of Polynomials. J. Autom. Reasoning 21(1), 23–38 (1998)
Knuth, D., Bendix, P.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra, pp. 263–297 (1970)
Koprowski, A., Zantema, H.: Recursive Path Ordering for Infinite Labelled Rewrite Systems. Technical Report CS-Report 06-17, Eindhoven Univ. of Tech (April 2006)
Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24(1/2), 89–105 (1995)
Zantema, H.: Term Rewriting Systems. In: Cambridge Tracts in TCS, ch. 6, vol. 55, pp. 181–259. Cambridge University Press, Cambridge (2003)
Zantema, H.: TORPA: Termination of rewriting proved automatically. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 95–104. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koprowski, A., Zantema, H. (2006). Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. In: Furbach, U., Shankar, N. (eds) Automated Reasoning. IJCAR 2006. Lecture Notes in Computer Science(), vol 4130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814771_30
Download citation
DOI: https://doi.org/10.1007/11814771_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37187-8
Online ISBN: 978-3-540-37188-5
eBook Packages: Computer ScienceComputer Science (R0)