COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode, FMCO, ser. LNCS, pp.113-132, 2007. ,
DOI : 10.1007/978-3-540-74061-2_11
A new recursion-theoretic characterization of the polytime functions, Computational Complexity, vol.106, issue.2, pp.97-110, 1992. ,
DOI : 10.1007/BF01201998
Size-change termination, monotonicity constraints and ranking functions, Log. Meth. Comput. Sci, vol.6, issue.3, 2010. ,
On the termination of integer loops, VMCAI, ser. LNCS, pp.72-87, 2012. ,
Automatic Certification of Heap Consumption, LPAR, ser, pp.347-362, 2004. ,
DOI : 10.1007/978-3-540-32275-7_23
Certified Memory Usage Analysis, FM 2005: Formal Methods, ser. LNCS, pp.91-106, 2005. ,
DOI : 10.1007/11526841_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.1873
Memory Usage Verification for OO Programs, Static Analysis, pp.70-86, 2005. ,
DOI : 10.1007/11547662_7
Terminator: Beyond Safety, CAV, ser. LNCS, pp.415-426, 2006. ,
DOI : 10.1007/11817963_37
URL : http://hdl.handle.net/11858/00-001M-0000-000F-2418-5
SPEED: Symbolic Complexity Bound Analysis, CAV, ser. LNCS, pp.51-62, 2009. ,
DOI : 10.1007/978-3-642-02658-4_7
Speed: precise and efficient static estimation of program computational complexity, POPL, pp.127-139, 2009. ,
Type-Based Complexity Analysis for Fork Processes, FOSSACS, ser. LNCS, pp.305-320, 2013. ,
DOI : 10.1007/978-3-642-37075-5_20
URL : https://hal.archives-ouvertes.fr/hal-00755450
Static prediction of heap space usage for first-order functional programs, pp.185-197, 2003. ,
Efficient Type-Checking for Amortised Heap-Space Analysis, CSL, ser. LNCS, pp.317-331, 2009. ,
DOI : 10.1137/0606031
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
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
A flow calculus of wp-bounds for complexity analysis, ACM Trans. Comput. Log, vol.10, issue.4, 2009. ,
Static determination of quantitative resource usage for higher-order programs, POPL, pp.223-236, 2010. ,
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 ,
DOI : 10.1145/2388936.2388959
Lambda calculus characterizations of poly-time, Fundam. Inform, vol.19, issue.12, pp.167-184, 1993. ,
DOI : 10.1007/BFb0037112
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
Resource control graphs, ACM Transactions on Computational Logic, vol.10, issue.4, pp.1-2944, 2009. ,
DOI : 10.1145/1555746.1555753
URL : https://hal.archives-ouvertes.fr/hal-00107145
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
Transition predicate abstraction and fair termination, POPL. ACM, pp.132-144, 2005. ,
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