R. Amadio, Max-Plus Quasi-interpretations, Typed Lambda Calculi and Applications, 6th International Conference Proceedings, volume 2701 of Lecture Notes in Computer Science, pp.31-45, 2003.
DOI : 10.1007/3-540-44904-3_3

URL : https://hal.archives-ouvertes.fr/hal-00146999

R. Amadio, S. Coupet-grimal, S. Dal-zilio, and L. Jakubiec, A Functional Scenario for Bytecode Verification of Resource Bounds, Computer Science Logic, 18th International Workshop, CSL 13th Annual Conference of the EACSL, pp.265-279, 2004.
DOI : 10.1007/978-3-540-30124-0_22

URL : https://hal.archives-ouvertes.fr/hal-00146991

R. Amadio and S. Dal-zilio, Resource control for synchronous cooperative threads
URL : https://hal.archives-ouvertes.fr/hal-00146983

T. Arts and J. Giesl, Termination of term rewriting using dependency pairs, Theoretical Computer Science, vol.236, issue.1-2, pp.133-178, 2000.
DOI : 10.1016/S0304-3975(99)00207-8

D. Aspinall and A. Compagnoni, Heap-Bounded Assembly Language, Journal of Automated Reasoning, vol.31, issue.3/4, pp.261-302, 2003.
DOI : 10.1023/B:JARS.0000021014.79255.33

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6038

M. Blum, A Machine-Independent Theory of the Complexity of Recursive Functions, Journal of the ACM, vol.14, issue.2, pp.322-336, 1967.
DOI : 10.1145/321386.321395

G. Bonfante, J. Marion, and J. Moyen, On Lexicographic Termination Ordering with Space Bound Certifications, PSI 2001, 2001.
DOI : 10.1007/3-540-45575-2_46

URL : https://hal.archives-ouvertes.fr/inria-00100523

G. Bonfante, J. Marion, and J. Moyen, Quasi-interpretations a way to control resources, Theoretical Computer Science, vol.412, issue.25, 2005.
DOI : 10.1016/j.tcs.2011.02.007

URL : https://hal.archives-ouvertes.fr/hal-00591862

G. Bonfante, J. Marion, J. Moyen, and R. Péchoux, Synthesis of quasi- interpretations, Workshop on Logic and Complexity in Computer Science, LCC2005, Chicago, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000660

M. Hofmann, Linear types and non-size-increasing polynomial time computation, Proceedings of the Fourteenth IEEE Symposium on Logic in Computer Science (LICS'99), pp.464-473, 1999.
DOI : 10.1016/s0890-5401(03)00009-9

URL : http://doi.org/10.1016/s0890-5401(03)00009-9

M. Hofmann, A Type System for Bounded Space and Functional In-Place Update???Extended Abstract, European Symposium on Programming, ESOP'00, pp.165-179, 2000.
DOI : 10.1007/3-540-46425-5_11

N. D. Jones, Computability and Complexity from a Programming Perspective, 1997.
DOI : 10.1007/978-94-010-0413-8_4

N. D. Chin-soon-lee, . Jones, M. Amir, and . Ben-amram, The size-change principle for program termination, Symposium on Principles of Programming Languages, pp.81-92, 2001.

J. Marion, Analysing the implicit complexity of programs, Information and Computation, vol.183, issue.1, pp.2-18, 2003.
DOI : 10.1016/S0890-5401(03)00011-7

URL : https://hal.archives-ouvertes.fr/inria-00099505

J. Marion and J. Moyen, Efficient first order functional program interpreter with time bound certifications, Logic for Programming and Automated Reasoning, 7th International Conference, pp.25-42, 1955.
URL : https://hal.archives-ouvertes.fr/inria-00099178

J. Marion and R. Péchoux, Resource Analysis by Sup-interpretation, Functional and Logic Programming: 8th International Symposium, FLOPS 2006, pp.163-176, 2006.
DOI : 10.1007/11737414_12

URL : https://hal.archives-ouvertes.fr/inria-00000661