E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini, COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode, FMCO. LNCS, pp.113-132, 2007.
DOI : 10.1007/978-3-540-74061-2_11

E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini, Cost analysis of object-oriented bytecode programs, Theoretical Computer Science, vol.413, issue.1, pp.142-159, 2012.
DOI : 10.1016/j.tcs.2011.07.009

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

A. M. Ben-amram, Size-change termination, monotonicity constraints and ranking functions, Log. Meth. Comput. Sci, vol.6, issue.3, 2010.
DOI : 10.2168/lmcs-6(3:2)2010

URL : http://arxiv.org/abs/1005.0253

A. M. Ben-amram, S. Genaim, and A. N. Masud, On the termination of integer loops, VMCAI. LNCS, pp.72-87, 2012.

L. Beringer, M. Hofmann, A. Momigliano, and O. Shkaravska, Automatic Certification of Heap Consumption, LPAR. LNCS, pp.347-362, 2004.
DOI : 10.1007/978-3-540-32275-7_23

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.2243

D. Cachera, T. Jensen, D. Pichardie, and G. Schneider, Certified Memory Usage Analysis, FM 2005: Formal Methods, pp.91-106, 2005.
DOI : 10.1007/11526841_8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.1873

W. Chin, H. Nguyen, S. Qin, and M. Rinard, Memory Usage Verification for OO Programs, Static Analysis, SAS 2005, pp.70-86, 2005.
DOI : 10.1007/11547662_7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.8358

B. Cook, A. Podelski, and A. Rybalchenko, Terminator: Beyond Safety, CAV. LNCS, pp.415-426, 2006.
DOI : 10.1007/11817963_37

URL : http://hdl.handle.net/11858/00-001M-0000-000F-2418-5

S. Gulwani, SPEED: Symbolic Complexity Bound Analysis, CAV. LNCS, pp.51-62, 2009.
DOI : 10.1007/978-3-642-02658-4_7

S. Gulwani, K. K. Mehra, and T. M. Chilimbi, Speed: precise and efficient static estimation of program computational complexity, pp.127-139, 2009.

E. Hainry, J. Y. Marion, and R. Péchoux, Type-Based Complexity Analysis for Fork Processes, FOSSACS. LNCS, pp.305-320, 2013.
DOI : 10.1007/978-3-642-37075-5_20

URL : https://hal.archives-ouvertes.fr/hal-00755450

M. Hofmann and S. Jost, Static prediction of heap space usage for first-order functional programs, pp.185-197, 2003.

M. Hofmann and S. Jost, Type-Based Amortised Heap-Space Analysis, ESOP. LNCS, pp.22-37, 2006.
DOI : 10.1007/3-540-45332-6_7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.3212

M. Hofmann and D. Rodriguez, Efficient Type-Checking for Amortised Heap-Space Analysis, CSL. LNCS, pp.317-331, 2009.
DOI : 10.1137/0606031

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.514.3261

M. Hofmann and U. Schöpp, Pointer Programs and Undirected Reachability, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.133-142, 2009.
DOI : 10.1109/LICS.2009.41

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.5869

M. Hofmann and U. Schöpp, Pure pointer programs with iteration, ACM Trans. Comput. Log, vol.11, issue.4, 2010.
DOI : 10.1145/1805950.1805956

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.8545

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.1141

N. D. Jones and L. Kristiansen, A flow calculus of wp-bounds for complexity analysis, ACM Trans. Comput. Log, vol.10, issue.4, 2009.

S. Jost, K. Hammond, H. W. Loidl, and M. Hofmann, Static determination of quantitative resource usage for higher-order programs, pp.223-236, 2010.

D. Leivant and J. Y. Marion, Lambda calculus characterizations of poly-time, Fundam. Inform, vol.19, issue.12, pp.167-184, 1993.
DOI : 10.1007/BFb0037112

J. Y. Marion, A Type System for Complexity Flow Analysis, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.123-132, 2011.
DOI : 10.1109/LICS.2011.41

URL : https://hal.archives-ouvertes.fr/hal-00591853

J. Y. Moyen, Resource control graphs, ACM Transactions on Computational Logic, vol.10, issue.4, 2009.
DOI : 10.1145/1555746.1555753

URL : https://hal.archives-ouvertes.fr/hal-00107145

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

A. Podelski and A. Rybalchenko, Transition predicate abstraction and fair termination, pp.132-144, 2005.
DOI : 10.1145/1232420.1232422

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.592.2631

D. Volpano, C. Irvine, and G. Smith, A sound type system for secure flow analysis, Journal of Computer Security, vol.4, issue.2-3, pp.167-188, 1996.
DOI : 10.3233/JCS-1996-42-304

URL : http://doi.org/10.3233/jcs-1996-42-304