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

P. Baillot and K. Terui, Light types for polynomial time computation in lambdacalculus, Logic in Computer Science, LICS 2004, pp.266-275, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00012752

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, S. Genaim, and A. N. Masud, On the termination of integer loops, VMCAI. LNCS, pp.72-87, 2012.

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

B. Cook, A. Podelski, and A. Rybalchenko, Terminator: Beyond Safety, Computer Aided Verification, CAV 2006, pp.415-426, 2006.
DOI : 10.1007/11817963_37
URL : http://hdl.handle.net/11858/00-001M-0000-000F-2418-5

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

S. Gulwani, SPEED: Symbolic Complexity Bound Analysis, CAV 2009, 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 2013, pp.305-320, 2013.
DOI : 10.1007/978-3-642-37075-5_20
URL : https://hal.archives-ouvertes.fr/hal-00755450

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

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.135-144, 2012.
DOI : 10.1145/2388936.2388959

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

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

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

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