Quasi-interpretations and small space bounds

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 150-164

  Bonfante, Guillaume ^a,b   Marion, Jean Yves ^a,b   Moyen, Jean Yves ^a,b  

^a LORIA   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SCIENCE; CONSTRAINT THEORY; LINEAR SYSTEMS; OPTIMIZATION; RESOURCE ALLOCATION;

LINEARITY CONSTRAINTS; QUASI-INTERPRETATION; SMALL SPACE BOUNDS;

TECHNICAL WRITING;

EID: 24944588082     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_12     Document Type: Conference Paper

References (29)

1. Benzinger, R.: Automated complexity analysis of NUPRL extracts. PhD thesis, Cornell University (1999)
2. Hofbauer, D., Lautemann, G.: Termination proofs and the length of derivations. In: RTA. Number 355 in Lecture Notes in Computer Science (1988)
3. Cichon, E., Lescanne, P.: Polynomial interpretations and the complexity of algorithms. In: CADE'11. Number 607 in Lecture Notes in Artificial Intelligence (1992) 139-147
4. Bonfante, G., Cichon, A., Marion, J.Y., Touzet, H.: Algorithms with polynomial interpretation termination proof. Journal of Functional Programming 11 (2000)
5. Marion, J.Y., Moyen, J.Y.: Efficient first order functional program interpreter with time bound certifications. In: LPAR 2000. Volume 1955 of Lecture Notes in Computer Science., Springer (2000) 25-42
6. Bonfante, G., Marion, J.Y., Moyen, J.Y.: On lexicographic termination ordering with space bound certifications. In: PSI 2001, Ershov Memorial Conference. Volume 2244 of Lecture Notes in Computer Science., Springer (2001)
7. Hofbauer, D.: Termination proofs with multiset path orderings imply primitive recursive derivation lengths. Theoretical Computer Science 105 (1992) 129-140
8. Weiermann, A.: Termination proofs by lexicographic path orderings yield multiply recursive derivation lengths. Theoretical Computer Science 139 (1995) 335-362
9. Ritchie, R.: Classes of predictably computable functions. Transaction of the American Mathematical Society 106 (1963) 139-173
10. Beckmann, A., Weiermann, A.: A term rewriting characterization of the polytime functions and related complexity classes. Archive for Mathematical Logic 36 (1996) 11-30
11. Marion, J.Y.: Analysing the implicit complexity of programs. Information and Computation 183 (2003) 2-18
12. Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity 2 (1992) 97-110
13. Leivant, D.: Predicative recurrence and computational complexity I: Word recurrence and poly-time. In Clote, P., Remmel, J., eds.: Feasible Mathematics II. Birkhäuser (1994) 320-343
14. Leivant, D., Marion, J.Y.: Lambda calculus characterizations of poly-time. Fundamenta Informaticae 19 (1993) 167,184
15. Jones, N.D.: LOGSPACE and PTIME characterized by programming languages. Theoretical Computer Science 228 (1999) 151-174
16. Gurevich, Y.: Algebras of feasible functions. In: Twenty Fourth Symposium on Foundations of Computer Science, IEEE Computer Society Press (1983) 210-214
17. Oitavem, I.: A term rewriting characterization of the functions computable in polynomial space. Archive for Mathematical Logic 41 (2002) 35-47
18. Amadio, R., Coupet-Grimai, S., Zilio, S.D., Jakubiec, L.: A functional scenario for bytecode verification of resource bounds. In: CSL. (2004) to appear.
19. Amadio, R.M., Dal-Zilio, S.: Resource control for synchronous cooperative threads. In: CONCUR. (2004) 68-82
20. Bonfante, G., Marion, J.Y., Moyen, J.Y., Péchoux, R.: Synthesis of quasi-interpretations. Technical report, Loria (2005) Submited to RULE '05. Available at http://www.loria.fr/~bonfante/publis/RULE05.pdf.
21. Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-interpretations. Technical report, Loria (2004) Submited to Theoretical Computer Science, accessible: http://www.loria.fr/~moyen/.
22. Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM 27 (1980) 797-821
23. Grädel, E., Gurevich, Y.: Tailoring recursion for complexity. Journal of Symbolic Logic 60 (1995) 952-969
24. Dershowitz, N.: Orderings for term-rewriting systems. Theoretical Computer Science 17 (1982) 279-301
25. Krishnamoorthy, M.S., Narendran, P.: On recursive path ordering. Theoretical Computer Science 40 (1985) 323-328
26. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236 (2000) 133-178
27. Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-interpretations and small space bounds. Technical report, Loria (2005) http://www.loria.fr/~bonfante/ publis/RTA05f.pdf.
28. Dershowitz, N.: A note on simplification ordering. Information Processing Letters 9 (1979) 212-215
29. Bonfante, G.: Constructions d'ordres, analyse de la complexité. Thèse, Institut National Polytechnique de Lorraine (2000)