R. Amadio, S. Coupet-grimal, S. Dal-zilio, and L. Jakubiec, A Functional Scenario for Bytecode Verification of Resource Bounds, CSL, 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, Concur, pp.68-82, 2004.
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. 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, 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 R. Péchoux, A Characterization of Alternating Log Time by First Order Functional Programs, LPAR 2006, pp.90-104, 2006.
DOI : 10.1007/11916277_7

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

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

S. Drossopoulou and S. Eisenbach, Describing the semantics of Java and proving type soundness . Formal Syntax and Semantics of Java, pp.41-82, 1999.

A. Igarashi, B. C. Pierce, and P. Wadler, Featherweight Java: a minimal core calculus for Java and GJ, ACM Transactions on Programming Languages and Systems, vol.23, issue.3, pp.396-450, 2001.
DOI : 10.1145/503502.503505

L. Kristiansen and N. D. Jones, The flow of data and the complexity of algorithms. New Computational Paradigms, pp.263-274

C. S. Lee, N. D. Jones, and A. M. Ben-amram, The size-change principle for program termination, Symposium on Principles of Programming Languages, pp.81-92, 2001.

J. Marion and R. Péchoux, Sup-interpretations, a semantic method for static analysis of program resources, ACM Transactions on Computational Logic, vol.10, issue.4
DOI : 10.1145/1555746.1555751

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

J. Marion and R. Péchoux, Resource Analysis by Sup-interpretation, FLOPS 2006, pp.163-176, 2006.
DOI : 10.1007/11737414_12

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

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