Quasi-interpretations a way to control resources

Theoretical Computer Science

Volumn 412, Issue 25, 2011, Pages 2776-2796

  Bonfante, G ^a   Marion, J Y ^a   Moyen, J Y ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b UNIVERSITÉ PARIS 13   (France)

Author keywords

Implicit complexity; Quasi interpretation; Termination orderings

Indexed keywords

COMPLEXITY CLASS; IMPLICIT COMPLEXITY; OPERATIONAL SEMANTICS; PROGRAM EXECUTION; QUASI-INTERPRETATION; RUNTIMES; SYSTEM COMPLEXITY; TERMINATION ORDERINGS; UPPER BOUND;

COMPUTER PROGRAMMING LANGUAGES;

SEMANTICS;

EID: 79955468226     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.02.007     Document Type: Article

References (38)

1. R. Amadio Max-plus quasi-interpretations Martin Hofmann, Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 1012, 2003, Proceedings Lecture Notes in Computer Science vol. 2701 2003 Springer 31 45
2. R. Amadio, S. Coupet-Grimal, S. Dal-Zilio, and L. Jakubiec A functional scenario for bytecode verification of resource bounds Jerzy Marcinkowski, Andrzej Tarlecki, Computer Science Logic, 18th International Workshop, CSL 13th Annual Conference of the EACSL, Karpacz, Poland Lecture Notes in Computer Science vol. 3210 2004 Springer 265 279 (Pubitemid 39751593)
3. N. Andersen, and N.D. Jones Generalizing Cook's transformation to imperative stack programs J. Karhumki, H. Maurer, G. Rozenberg, Results and Trends in Theoretical Computer Science Lecture Notes in Computer Science vol. 812 1994 1 18
4. S. Basu, R. Pollack, and M.-F. Roy On the combinatorial and algebraic complexity of quantifier elimination Journal of the ACM 43 6 1996 1002 1045 (Pubitemid 126626329)
5. S. Bellantoni, and S. Cook A new recursion-theoretic characterization of the poly-time functions Computational Complexity 2 1992 97 110
6. G. Bonfante, Constructions d'ordres, analyse de la complexit. Thse, Institut National Polytechnique de Lorraine, 2000.
7. G. Bonfante, A. Cichon, J.-Y. Marion, and H. Touzet Algorithms with polynomial interpretation termination proof Journal of Functional Programming 11 2000
8. G. Bonfante, J.-Y. Marion, and J.-Y. Moyen On lexicographic termination ordering with space bound certifications Dines Bjørner, Manfred Broy, Alexandre~V. Zamulin, Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, PSI 2001, Akademgorodok, Novosibirsk, Russia, Ershov Memorial Conference Lecture Notes in Computer Science vol. 2244 2001 Springer
9. Guillaume Bonfante, Jean-Yves Marion, and Romain Pchoux A characterization of alternating log time by first order functional programs LPAR Lecture Notes in Computer Science vol. 4246 2006 Springer 90 104 (Pubitemid 44850671)
10. V.-H. Caseiro, Equations for defining Poly-Time, Ph.D. Thesis, University of Oslo, 1997.
11. A. Chandra, D. Kozen, and L. Stockmeyer Alternation Journal of the ACM 28 1981 114 133
12. A. Cobham The intrinsic computational difficulty of functions Y. Bar-Hillel, Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science 1962 North-Holland Amsterdam 24 30
13. L. Colson Functions versus algorithms EATCS Bulletin 65 1998 The logic in computer science column
14. S. Cook Characterizations of pushdown machines in terms of time-bounded computers Journal of the ACM 18 1 1971 4 18
15. T.H. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1990 MIT Press
16. N. Dershowitz Orderings for term-rewriting systems Theoretical Computer Science 17 3 1982 279 301
17. N. Dershowitz, and J.-P. Jouannaud Rewrite systems Handbook of Theoretical Computer Science vol. B 1990 Elsevier Science Publishers B. V. North-Holland 243 320
18. D. Hofbauer Termination proofs with multiset path orderings imply primitive recursive derivation lengths Theoretical Computer Science 105 1 1992 129 140 (Pubitemid 23575738)
19. M. Hofmann, Linear types and non-size-increasing polynomial time computation, in: Proceedings of the Fourteenth IEEE Symposium on Logic in Computer Science, LICS'99, 1999, pp. 464473.
20. M. Hofmann A type system for bounded space and functional in-place update European Symposium on Programming, ESOP'00 Lecture Notes in Computer Science vol. 1782 2000 165 179
21. G. Huet Confluent reductions: abstract properties and applications to term rewriting systems Journal of the ACM 27 4 1980 797 821
22. N.D. Jones LOGSPACE and PTIME characterized by programming languages Theoretical Computer Science 228 1999 151 174 (Pubitemid 129610501)
23. S. Kamin, J.-J. Lvy, Attempts for generalising the recursive path orderings, Technical Report, Univerity of Illinois, Urbana, 1980. Accessible on http://perso.ens-lyon.fr/pierre.lescanne/notaccessible.html (unpublished note).
24. M.S. Krishnamoorthy, and P. Narendran On recursive path ordering Theoretical Computer Science 40 23 1985 323 328
25. D. Leivant Predicative recurrence and computational complexity I: word recurrence and poly-time Peter Clote, Jeffery Remmel, Feasible Mathematics II 1994 Birkhuser 320 343
26. D. Leivant, and J.-Y. Marion Lambda calculus characterizations of poly-time Fundamenta Informaticae 19 12 1993 167 184
27. D. Leivant, and J.-Y. Marion Ramified recurrence and computational complexity II: substitution and poly-space L. Pacholski, J. Tiuryn, Computer Science Logic, 8th Workshop, CSL'94 Lecture Notes in Computer Science vol. 933 1995 Springer Kazimierz, Poland 486 500
28. P. Lescanne Termination of rewrite systems by elementary interpretations H. Kirchner, G. Levi, 3rd International Conference on Algebraic and Logic Programming Lecture Notes in Computer Science vol. 632 1992 Springer 21 36
29. J.-Y. Marion, Complexit implicite des calculs, de la thorie la pratique, Habilitation diriger les recherches, Universit Nancy 2, 2000.
30. J.-Y. Marion Analysing the implicit complexity of programs Information and Computation 183 2003 2 18 Presented at ICC workshop affiliated with Floc 1999, Trento
31. J.-Y. Marion, and J.-Y. Moyen Efficient first order functional program interpreter with time bound certifications Michel Parigot, Andrei Voronkov, Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France Lecture Notes in Computer Science vol. 1955 2000 Springer 25 42
32. J.-Y. Marion, and R. Pchoux Resource analysis by sup-interpretation FLOPS Lecture Notes in Computer Science vol. 3945 2006 Springer 163 176 (Pubitemid 44029266)
33. Y.V. Matiyasevich Hilbert's 10th Problem Foundations of Computing Series 1993 The MIT Press
34. D. Plaisted, A recursively defined ordering for proving termination of term rewriting systems, Technical Report R-78-943, Department of Computer Science, University of Illinois, 1978.
35. W.J. Savitch Relationship between nondeterministic and deterministic tape classes Journal of Computer System Science 4 1970 177 192
36. G. Senizergues Some undecidable termination problems for semi-thue systems Theoretical Computer Science 142 1995 257 276
37. A. Tarski A Decision Method for Elementary Algebra and Geometry 2nd ed. 1951 University of California Press
38. A. Weiermann Termination proofs by lexicographic path orderings yield multiply recursive derivation lengths Theoretical Computer Science 139 1995 335 362