Proving quadratic derivational complexities using context dependent interpretations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5117 LNCS, Issue , 2008, Pages 276-290

  Moser, Georg ^a   Schnabl, Andreas ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; QUADRATIC PROGRAMMING;

CONTEXT-DEPENDENT; INTERNATIONAL CONFERENCES; NATURAL NUMBERS; NUMERICAL DATA; REWRITE SYSTEMS; UPPER BOUNDS;

CHLORINE COMPOUNDS;

EID: 48949099348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70590-1_19     Document Type: Conference Paper

References (22)

1. Hofbauer, D., Lautemann, C.: Termination proofs and the length of derivations. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 167-177. Springer, Heidelberg (1989)
2. Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. TCS 105, 129-140 (1992)
3. Weiermann, A.: Termination proofs for term rewriting systems with lexicographic path orderings imply multiply recursive derivation lengths. TCS 139, 355-362 (1995)
4. Moser, G.: Derivational complexity of Knuth Bendix orders revisited. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 75-89. Springer, Heidelberg (2006)
5. Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. IC 205, 512-534 (2007)
6. Hirokawa, N., Moser, G.: Automated complexity analysis based on the dependency pair method. In: Proc. 4th IJCAR. Springer, Heidelberg (accepted for publication, 2008)
7. Hofbauer, D.: Termination proofs by context-dependent interpretations. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 108-121. Springer, Heidelberg (2001)
8. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
9. Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)
10. Schnabl, A.: Context Dependent Interpretations. Master's thesis, Universität Innsbruck (2007), http://cl-informatik.uibk.ac.at/~aschnabl/
11. Contejean, E., Marché, C., Tomás, A.P., Urbain, X.: Mechanically proving termination using polynomial interpretations. JAR 34, 325-363 (2005)
12. Matiyasevich, Y.: Enumerable sets are diophantine. Soviet Mathematics (Dokladi) 11, 354-357 (1970)
13. Steinbach, J., Kühler, U.: Check your ordering - termination proofs and open problems. Technical Report SEKI-Report SR-90-25, University of Kaiserslautern (1990)
14. Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: SAT solving for termination analysis with polynomial interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 340-354. Springer, Heidelberg (2007)
15. Korp, M., Middeldorp, A.: Proving termination of rewrite systems using bounds. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 273-287. Springer, Heidelberg (2007)
16. Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. TCS 327, 301-317 (2004)
17. Bonfante, G., Cichon, A., Marion, J.Y., Touzet, H.: Algorithms with polynomial interpretation termination proof. JFP 11, 33-53 (2001)
18. Marion, J.Y.: Analysing the implicit complexity of programs. IC 183, 2-18 (2003)
19. Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-intepretations and small space bounds. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 150-164. Springer, Heidelberg (2005)
20. Marion, J.Y., Péchoux, R.: Resource analysis by sup-interpretation. In: Hagiya, M., Wadler, P. (eds.) FLOPS 2006. LNCS, vol. 3945, pp. 163-176. Springer, Heidelberg (2006)
21. Avanzini, M., Moser, G.: Complexity analysis by rewriting. In: Proc.9th FLOPS. LNCS, vol. 4989, pp. 130-146 (2008)
22. Caviness, B., Johnson, J. (eds.): Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, Heidelberg (2004)