Abstract
Rewrite systems form an attractive model of computation. In the past decades numerous methods have been developed to prove rewrite systems terminating. Spurred by the International Termination Competition, the emphasis in recent years is on powerful methods that can be automated.
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
References
Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. JAR 40(2-3), 195–220 (2008)
Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. I&C 205(4), 512–534 (2007)
Hofbauer, D., Lautemann, C.: Termination Proofs and the Length of Derivations (Preliminary Version). In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 167–177. Springer, Heidelberg (1989)
Middeldorp, A., Moser, G., Neurauter, F., Waldmann, J., Zankl, H.: Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. In: Winkler, F. (ed.) CAI 2011. LNCS, vol. 6742, pp. 1–20. Springer, Heidelberg (2011)
Moser, G., Schnabl, A., Waldmann, J.: Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS. LIPIcs, vol. 2, pp. 304–315 (2008)
Neurauter, F., Zankl, H., Middeldorp, A.: Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 550–564. Springer, Heidelberg (2010)
Waldmann, J.: Polynomially Bounded Matrix Interpretations. In: Lynch, C. (ed.) RTA. LIPIcs, vol. 6, pp. 357–372 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Middeldorp, A. (2012). Matrix Interpretations for Polynomial Derivational Complexity of Rewrite Systems. In: Bjørner, N., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2012. Lecture Notes in Computer Science, vol 7180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28717-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-28717-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28716-9
Online ISBN: 978-3-642-28717-6
eBook Packages: Computer ScienceComputer Science (R0)