R. Amadio, Synthesis of max-plus quasi-interpretations, Fundamenta Informaticae, vol.65, issue.12, pp.29-60, 2005.
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 LNCS, vol.3170, pp.68-82, 2004.
DOI : 10.1007/978-3-540-28644-8_5
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

M. Atjai, ? 1 1 -formulae on finite strutures, Annals of Pure and Applied Logic, issue.24, pp.1-48, 1983.

D. Barrington, N. Immerman, and H. Straubing, On uniformity within NC1, Journal of Computer and System Sciences, vol.41, issue.3, pp.274-306, 1990.
DOI : 10.1016/0022-0000(90)90022-D

S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity, vol.106, issue.2, pp.97-110, 1992.
DOI : 10.1007/BF01201998

S. Bloch, Function-algebraic characterizations of log and polylog parallel time, Computational Complexity, vol.22, issue.1, pp.175-205, 1994.
DOI : 10.1007/BF01202288

G. Bonfante, J. Marion, and J. Moyen, Quasi-interpretation: a way to control ressources. survey submitted, revision
URL : https://hal.archives-ouvertes.fr/inria-00001257

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

S. Buss, The Boolean formula value problem is in ALOGTIME, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.123-131, 1987.
DOI : 10.1145/28395.28409

A. Chandra, D. Kozen, and L. Stockmeyer, Alternation, Journal of the ACM, vol.28, issue.1, pp.114-133, 1981.
DOI : 10.1145/322234.322243

P. Clote, Computational models and function algebras, LCC'94, pp.98-130, 1995.

A. Cobham, The intrinsic computational difficulty of functions, Conf. on Logic, Methodology, and Philosophy of Science, pp.24-30, 1962.

K. J. Compton and C. Laflamme, An algebra and a logic for nc, Inf. Comput, vol.87, issue.12, pp.240-262, 1990.

A. Stephen and . Cook, A taxonomy of problems with fast parallel algorithms, Information and Control, vol.64, issue.1-3, pp.2-21, 1985.

S. Dal-zilio and R. Gascon, Resource Bound Certification for a Tail-Recursive Virtual Machine, APLAS 2005, pp.247-263, 2005.
DOI : 10.1007/11575467_17

M. Furst, J. Saxe, and M. Spiser, Parity, circuits, and the polynomial-time hierarchy, Mathematical Systems Theory, vol.3, issue.1, pp.13-27, 1984.
DOI : 10.1007/BF01744431

J. Marion, G. Bonfant, R. Kahle, and I. Oitavem, Towards an implicit characterization of nck, CSL'06

J. Girard, Light Linear Logic, prsentàprsentà LCC'94, pp.175-204, 1998.
DOI : 10.1006/inco.1998.2700
URL : http://doi.org/10.1006/inco.1998.2700

M. Hofmann, Programming languages capturing complexity classes, SIGACT News Logic Column 9, 2000.
DOI : 10.1145/346048.346051

L. Kristiansen and N. D. Jones, The Flow of Data and the Complexity of Algorithms, New Computational Paradigms, number 3526 in LNCS, pp.263-274, 2005.
DOI : 10.1007/11494645_33

N. D. Chin-soon-lee, . Jones, M. Amir, and . Ben-amram, The size-change principle for program termination, POPL, pp.81-92, 2001.

D. Leivant, Predicative recurrence and computational complexity I: Word recurrence and poly-time, Feasible Mathematics II, pp.320-343, 1994.
DOI : 10.1007/978-1-4612-2566-9_11

D. Leivant, A characterization of NC by tree recurrence, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.716-724, 1998.
DOI : 10.1109/SFCS.1998.743522

D. Leivant and J. Marion, Lambda calculus characterizations of poly-time, Fundamenta Informaticae, vol.19184, issue.12, p.167, 1993.
DOI : 10.1007/BFb0037112

D. Leivant and J. Marion, A characterization of alternating log time by ramified recurrence, Theoretical Computer Science, vol.236, issue.1-2, pp.192-208, 2000.
DOI : 10.1016/S0304-3975(99)00209-1
URL : https://hal.archives-ouvertes.fr/inria-00099078

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. Pechoux, Resource Analysis by Sup-interpretation, FLOPS 2006, pp.163-176, 2006.
DOI : 10.1007/11737414_12
URL : https://hal.archives-ouvertes.fr/inria-00000661

J. Moyen, Analyse de la complexité et transformation de programmes, Thèse d'université, 2003.

K. Niggl and H. Wunderlich, Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs, SIAM Journal on Computing, vol.35, issue.5
DOI : 10.1137/S0097539704445597

W. Ruzzo, On uniform circuit complexity, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.365-383, 1981.
DOI : 10.1109/SFCS.1979.31
URL : http://doi.org/10.1016/0022-0000(81)90038-6