E. Albert, P. Arenas, S. Genaim, and G. Puebla, Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis, Proceedings SAS 2008, pp.221-237, 2008.
DOI : 10.1007/978-3-540-69166-2_15

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

E. Albert, P. Arenas, S. Genaim, M. Gómez-zamalloa, and G. Puebla, Cost Analysis of Concurrent OO Programs, Proceedings of APLAS 2011, pp.238-254, 2011.
DOI : 10.1007/978-3-540-70592-5_6

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

E. Albert, J. Correas, and G. Romn-dez, Peak Cost Analysis of Distributed Systems, Proceedings of SAS 2014, pp.18-33, 2014.
DOI : 10.1007/978-3-319-10936-7_2

E. Albert, J. Correas, and G. Román-díez, Non-cumulative Resource Analysis, Proceedings of TACAS 2015, 2015.
DOI : 10.1007/978-3-662-46681-0_6

D. E. Alonso-blas and S. Genaim, On the Limits of the Classical Approach to Cost Analysis, Proceedings of SAS 2012, pp.405-421, 2012.
DOI : 10.1007/978-3-642-33125-1_27

R. Barik, Efficient Computation of May-Happen-in-Parallel Information for Concurrent Java Programs, Proceedings of LCPC 2005, pp.152-169, 2006.
DOI : 10.1007/978-3-540-69330-7_11

M. Brockschmidt, F. Emmes, S. Falke, C. Fuhs, and J. Giesl, Alternating Runtime and Size Complexity Analysis of Integer Programs, Proceedings of TACAS 2014, pp.140-155, 2014.
DOI : 10.1007/978-3-642-54862-8_10

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

A. , F. Montoya, and R. Hähnle, Resource analysis of complex programs with cost equations, Proceedings of 12th Asian Symposium on Programming Languages and Systems, pp.275-295, 2014.

E. Giachino, C. Laneve, and M. Lienhardt, A framework for deadlock detection in ABS. Software and Systems Modeling, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01229046

S. Gulwani, K. K. Mehra, and T. Chilimbi, SPEED, ACM SIGPLAN Notices, vol.44, issue.1, pp.127-139, 2009.
DOI : 10.1145/1594834.1480898

J. Hoffmann and Z. Shao, Automatic static cost analysis for parallel programsOnline; accessed 11, 2015.

J. Hoffmann, K. Aehlig, and M. Hofmann, Multivariate amortized resource analysis, ACM Trans. Program. Lang. Syst, vol.34, issue.3, p.14, 2012.

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

M. Hofmann and S. Jost, Type-Based Amortised Heap-Space Analysis, Proceedings of ESOP 2006, 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, Proceedings of CSL 2009, pp.317-331, 2009.
DOI : 10.1137/0606031

E. B. Johnsen, R. Hähnle, J. Schäfer, R. Schlatte, and M. Steffen, ABS: A Core Language for Abstract Behavioral Specification, Proceedings of FMCO 2010, pp.142-164, 2011.
DOI : 10.2498/cit.2002.01.01

R. E. Tarjan, Amortized Computational Complexity, SIAM Journal on Algebraic Discrete Methods, vol.6, issue.2, pp.306-318, 1985.
DOI : 10.1137/0606031

B. Wegbreit, Mechanical program analysis, Communications of the ACM, vol.18, issue.9, pp.528-539, 1975.
DOI : 10.1145/361002.361016