E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini, Cost Analysis of Java Bytecode, Programming Languages and Systems, pp.157-172, 2007.
DOI : 10.1007/978-3-540-71316-6_12

E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini, Removing useless variables in cost analysis of Java bytecode, Proceedings of the 2008 ACM symposium on Applied computing , SAC '08, pp.368-375, 2008.
DOI : 10.1145/1363686.1363779

X. Allamigeon and C. Hymans, Static analysis by abstract interpretation: application to the detection of heap overflows, Journal in Computer Virology, vol.5, issue.3, 2007.
DOI : 10.1007/s11416-007-0063-z

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, In CONCUR LNCS, vol.3170, pp.68-82, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00146983

R. J. Anderson, Security engineering: a guide to building dependable distributed systems, 2001.

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

G. Bonfante, J. Y. Marion, and J. Y. Moyen, Quasi-interpretations, a way to control resources. Theoretical Computer Science
URL : https://hal.archives-ouvertes.fr/hal-00591862

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590

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, LNCS, pp.41-82, 1999.
DOI : 10.1007/3-540-48737-9_2

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, 2006.

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

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, 2008.
DOI : 10.1145/1555746.1555751
URL : https://hal.archives-ouvertes.fr/inria-00446057

J. Y. Marion and R. Péchoux, A Characterization of NCk by First Order Functional Programs, TAMC, pp.136-147, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00332390

A. Miné, Field-sensitive value analysis of embedded C programs with union types and pointer arithmetics, ACM SIG- PLAN/SIGBED Conf. on Languages, Compilers, and Tools for Embedded Systems (LCTES'06), pp.54-63, 2006.

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

A. Podelski and A. Rybalchenko, Transition predicate abstraction and fair termination This work is licensed under the Creative Commons Attribution- NonCommercial-No Derivative Works 3, POPL, pp.132-144, 2005.