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

R. Benzinger, Automated higher-order complexity analysis, Theoretical Computer Science, vol.318, issue.1-2, pp.79-103, 2004.
DOI : 10.1016/j.tcs.2003.10.022

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, A. Cichon, J. Marion, and H. Touzet, Algorithms with polynomial interpretation termination proof, Journal of Functional Programming, vol.11, issue.1, pp.33-53, 2001.
DOI : 10.1017/S0956796800003877
URL : https://hal.archives-ouvertes.fr/inria-00100819

G. Bonfante, J. Moyen, J. Marion, 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

G. Bonfante, J. Marion, and J. Moyen, On Lexicographic Termination Ordering with Space Bound Certifications, Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, 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

S. K. Debray and N. W. Lin, Cost analysis of logic programs, ACM Transactions on Programming Languages and Systems, vol.15, issue.5, pp.826-875, 1993.
DOI : 10.1145/161468.161472

N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation, vol.3, issue.1-2, pp.69-115, 1987.
DOI : 10.1016/S0747-7171(87)80022-6

S. G. Frankau and A. Mycroft, Stream processing hardware from functional language specifications, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the, 2003.
DOI : 10.1109/HICSS.2003.1174809

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.

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

A. Hugh and S. C. Khoo, Affined-based size-change termination, APLAS, 2003.

D. S. Lankford, On proving term rewriting systems are noetherien, 1979.

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.

S. Lucas, Polynomials over the reals in proofs of termination : from theory to practice, Theoretical Informatics and Applications, pp.547-586, 2005.
DOI : 10.1051/ita:2005029

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. Regehr, Say no to stack overflow, 2004.

R. Thiemann and J. Giesl, Size-Change Termination for Term Rewriting, 14th International Conference on Rewriting Techniques and Applications, 2003.
DOI : 10.1007/3-540-44881-0_19