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.1515/9781400858927

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

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

E. Hainry and R. Péchoux, Objects in Polynomial Time, APLAS 2015 Lecture Notes in Computer Science, vol.9458, pp.387-404, 2015.
DOI : 10.1007/978-3-319-26529-2_21
URL : https://hal.archives-ouvertes.fr/hal-01206161

J. 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

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

J. Girard, Light Linear Logic, Information and Computation, vol.143, issue.2, pp.175-204, 1998.
DOI : 10.1006/inco.1998.2700

S. A. Cook and C. Rackoff, Space Lower Bounds for Maze Threadability on Restricted Machines, SIAM Journal on Computing, vol.9, issue.3, pp.636-652, 1980.
DOI : 10.1137/0209048

N. Danner and J. S. Royer, Ramified structural recursion and corecursion

E. Hainry, J. Marion, and R. Péchoux, Type-Based Complexity Analysis for Fork Processes, FOSSACS Lecture Notes in Computer Science, vol.7794, pp.305-320, 2013.
DOI : 10.1007/978-3-642-37075-5_20
URL : https://hal.archives-ouvertes.fr/hal-00755450

D. Leivant and J. Marion, Evolving Graph-Structures and Their Implicit Computational Complexity, Automata, Languages, and Programming -ICALP 2013, pp.349-360, 2013.
DOI : 10.1007/978-3-642-39212-2_32
URL : https://hal.archives-ouvertes.fr/hal-00939484

K. 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

J. Moyen, Resource control graphs, ACM Transactions on Computational Logic, vol.10, issue.4, pp.1-29, 2009.
DOI : 10.1145/1555746.1555753
URL : https://hal.archives-ouvertes.fr/hal-00107145

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

M. Hofmann and S. Jost, Type-Based Amortised Heap-Space Analysis, Lecture Notes in Computer Science, vol.132, issue.2, pp.22-37, 2006.
DOI : 10.1007/3-540-45332-6_7

M. Hofmann and D. Rodriguez, Efficient Type-Checking for Amortised Heap-Space Analysis, Lecture Notes in Computer Science, vol.6, issue.2, pp.317-331, 2009.
DOI : 10.1137/0606031

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

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

L. Beringer, M. Hofmann, A. Momigliano, and O. Shkaravska, Automatic Certification of Heap Consumption, Lecture Notes in Computer Science, vol.3452, pp.347-362, 2004.
DOI : 10.1007/978-3-540-32275-7_23

E. Albert, P. Arenas, S. Genaim, G. Puebla, D. Zanardini et al., COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode, Lecture Notes in Computer Science, vol.25, issue.5, pp.113-132, 2008.
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

R. Kersten, O. Shkaravska, B. Van-gastel, M. Montenegro, and M. C. Van-eekelen, Making resource analysis practical for real-time Java, Proceedings of the 10th International Workshop on Java Technologies for Real-time and Embedded Systems, JTRES '12, pp.12-135, 2012.
DOI : 10.1145/2388936.2388959

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://www-sop.inria.fr/everest/personnel/David.Pichardie/Publis/memoryusage.pdf

E. Albert, S. Genaim, M. Gómez-zamalloa, and . Gil, Live heap space analysis for languages with garbage collection, Proceedings of the 2009 international symposium on Memory management, ISMM '09, pp.129-138, 2009.
DOI : 10.1145/1542431.1542450

E. Albert, S. Genaim, and M. Gómez-zamalloa, Parametric inference of memory requirements for garbage collected languages, Proceedings of the 2010 international symposium on Memory management, ISMM '10, pp.121-130, 2010.
DOI : 10.1145/1806651.1806671

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

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://www.tcs.ifi.lmu.de/~schoepp/Docs/reach.pdf

M. Hofmann and U. Schöpp, Pure pointer programs with iteration, ACM Trans. Comput. Log, vol.11, issue.4
DOI : 10.1007/978-3-540-87531-4_8
URL : http://www.tcs.ifi.lmu.de/~schoepp/Docs/zaehlen.pdf

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

A. M. Ben-amram, S. Genaim, and A. N. Masud, On the Termination of Integer Loops, Model Checking, and Abstract Interpretation, VMCAI 2012, pp.72-87, 2012.
DOI : 10.1007/978-3-540-27813-9_6

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

A. Podelski and A. Rybalchenko, Transition predicate abstraction and fair termination, Symposium on Principles of Programming Languages, POPL 2005, pp.132-144, 2005.
DOI : 10.1145/1232420.1232422
URL : http://www7.in.tum.de/~rybal/papers/popl05-transition-predicate-abstraction.pdf

S. Gulwani, SPEED: Symbolic Complexity Bound Analysis, Lecture Notes in Computer Science, vol.18, issue.9, pp.51-62, 2009.
DOI : 10.1007/978-3-540-70545-1_6

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