Complexity analysis by rewriting

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

Volumn 4989 LNCS, Issue , 2008, Pages 130-146

  Avanzini, Martin ^a   Moser, Georg ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONAL PROGRAMMING; POLYNOMIALS;

COMPLEXITY ANALYSIS; REWRITING;

COMPUTER SOFTWARE;

EID: 43349097815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78969-7_11     Document Type: Conference Paper

References (27)

1. Arai, T., Moser, G.: Proofs of Termination of Rewrite Systems for Polytime Functions. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 529-540. Springer, Heidelberg (2005)
2. Avanzini, M., Hirokawa, N., Middeldorp, A., Moser, G.: Towards an automatic runtime complexity analysis of Scheme programs by rewriting. (Submitted December 2007)5
3. 5 (October 2007)
4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press. Cambridge (1998)
5. Beckmann, A., Weiermann, A.: A term rewriting characterization of the polytime functions and related complexity classes. Archive 36, 11-30 (1996)
6. Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Comput. Complexity 2(2), 97-110 (1992)
7. Bonfante, G., Cichon, A., Marion, J.-Y., Touzet, H.: Algorithms with polynomial interpretation termination proof. JFP 11(1), 33-53 (2001)
8. 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)
9. Buchholz, W.: Proof-theoretic analysis of termination proofs. APAL 75, 57-65 (1995)
10. Contejean, E.. Marché, C., Tomás. A.P., Urbain, X.: Mechanically proving termination using polynomial interpretations. JAR 34(4), 325-363 (2005)
11. Hirokawa, N., Middeldorp, A.: Tsukuba termination tool. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 311-332. Springer, Heidelberg (2003)
12. Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. TCS 105(1), 129-140 (1992)
13. 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)
14. Hofmann, M.: Linear types and non-size increasing polynomial time compuations. In: Proc. 14th LICS, pp. 464-473 (1999)
15. Lepper, I.: Derivation lengths and order types of Knuth-Bendix orders. TCS 269. 433-450 (2001)
16. Lucas, S., Peña, R.: Termination and complexity bounds for SAFE programs. In: Proc. 7th PROLE, pp. 233-242 (2007)
17. Marion, J.: Analysing the implicit complexity of programs. IC 183, 2-18 (2003)
18. 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)
19. Schneider-Kamp, P., Thiemann, R.. Annov, E.. Codish, M., Giesl, J.: Proving termination using recursive path orders and SAT solving. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol. 4720, pp. 267-282. Springer, Heidelberg (2007)
20. Schwichtenberg, H.: An arithmetic for polynomial-time computation. TCS 357(1). 202-214 (2006)
21. Sperber, M., Dybvig, R.K., Flatt, M., Stratten, A.v., et al.: Revised report on the algorithmic language Scheme (2007), http://www.r6rs.org
22. Steinbach, J., Kühler, U.: Check your ordering - termination proofs and open problems. Technical Report SEKI-Report SR-90-25, University of Kaiserslautern (1990)
23. Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press. Cambridge (2003)
24. Toyama. Y.: Termination of S-expression rewriting systems: Lexicographic path ordering for higher-order terms. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 40-54. Springer, Heidelberg (2004)
25. Weiermann, A.: Termination proofs for term rewriting systems with lexicographic path ordering imply multiply recursive derivation lengths. TCS 139, 355-362 (1995)
26. Zankl, H., Middeldorp. A.: Satisfying KBO constraints. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 389-403. Springer, Heidelberg (2007)
27. Zantema, H.: Termination of term rewriting by semantic labelling. FI 24, 89-105 (1995)