R. Amadio, Synthesis of max-plus quasi-interpretations, Research Report LIF Fundamenta Informaticae, vol.65, issue.12, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00146968

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, In CONCUR Lecture Notes in Computer Science, vol.32, issue.4, pp.68-82, 2004.
DOI : 10.1007/3-540-46425-5_1
URL : https://hal.archives-ouvertes.fr/hal-00146983

G. Bonfante, Constructions d'ordres, analyse de la complexité, Thèse, Institut National Polytechnique de Lorraine, 2000.

G. Bonfante, A. Cichon, J. Marion, and H. Touzet, Complexity Classes and Rewrite Systems with Polynomial Interpretation, Computer Science Logic, 12th International Workshop, CSL'98, pp.372-384, 1999.
DOI : 10.1007/10703163_25
URL : https://hal.archives-ouvertes.fr/inria-00098689

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

G. Bonfante, J. Marion, and J. Moyen, Quasi-interpretations and Small Space Bounds, 16th International Conference on Rewriting Techniques and Applications, 2005.
DOI : 10.1007/978-3-540-32033-3_12
URL : https://hal.archives-ouvertes.fr/inria-00001234

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

J. Heintz, M. Roy, and P. Solerno, Sur la complexit?? du principe de Tarski-Seidenberg, Bulletin de la Société mathématique de France, vol.118, issue.1, pp.101-126, 1990.
DOI : 10.24033/bsmf.2138
URL : http://archive.numdam.org/article/BSMF_1990__118_1_101_0.pdf

G. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM, vol.27, issue.4, pp.797-821, 1980.
DOI : 10.1145/322217.322230

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

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

J. Marion, Complexité implicite des calculs, de la théoriè a la pratique

. Habilitationàhabilitation, Habilitationà diriger les recherches, 2000.

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. Moyen, System Presentation, Electronic Notes in Theoretical Computer Science, vol.59, issue.4, 2001.
DOI : 10.1016/S1571-0661(04)00300-7
URL : https://hal.archives-ouvertes.fr/inria-00100525

J. Robinson, Definability and decision problems in arithmetic, The Journal of Symbolic Logic, pp.98-114, 1949.
DOI : 10.1215/S0012-7094-47-01439-7

A. Tarski, A Decision Method for Elementary Algebra and Geometry, 1951.
DOI : 10.1007/978-3-7091-9459-1_3