| Cost analysis of java bytecode E Albert, P Arenas, S Genaim, G Puebla, D Zanardini European symposium on programming, 157-172, 2007 | 218 | 2007 |
| Closed-form upper bounds in static cost analysis E Albert, P Arenas, S Genaim, G Puebla Journal of automated reasoning 46 (2), 161-203, 2011 | 181 | 2011 |
| Cost analysis of object-oriented bytecode programs E Albert, P Arenas, S Genaim, G Puebla, D Zanardini Theoretical Computer Science 413 (1), 142-159, 2012 | 135 | 2012 |
| Automatic inference of upper bounds for recurrence relations in cost analysis E Albert, P Arenas, S Genaim, G Puebla International Static Analysis Symposium, 221-237, 2008 | 115 | 2008 |
| COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode E Albert, P Arenas, S Genaim, G Puebla, D Zanardini International Symposium on Formal Methods for Components and Objects, 113-132, 2007 | 112 | 2007 |
| Information flow analysis for java bytecode S Genaim, F Spoto International Workshop on Verification, Model Checking, and Abstract …, 2005 | 104 | 2005 |
| Termination analysis of logic programs through combination of type-based norms M Bruynooghe, M Codish, JP Gallagher, S Genaim, W Vanhoof ACM Transactions on Programming Languages and Systems (TOPLAS) 29 (2), 10-es, 2007 | 82 | 2007 |
| SACO: static analyzer for concurrent objects E Albert, P Arenas, A Flores-Montoya, S Genaim, M Gómez-Zamalloa, ... International Conference on Tools and Algorithms for the Construction and …, 2014 | 81 | 2014 |
| Termination analysis of Java bytecode E Albert, P Arenas, M Codish, S Genaim, G Puebla, D Zanardini International Conference on Formal Methods for Open Object-Based Distributed …, 2008 | 77 | 2008 |
| Preference-based configuration of web page content C Domshlak, S Genaim, R Brafman 14th European Conference on Artificial Intelligence (ECAI 2000 …, 2000 | 69 | 2000 |
| On the linear ranking problem for integer linear-constraint loops AM Ben-Amram, S Genaim ACM SIGPLAN Notices 48 (1), 51-62, 2013 | 66 | 2013 |
| Heap space analysis for Java bytecode E Albert, S Genaim, M Gomez-Zamalloa Proceedings of the 6th international symposium on Memory management, 105-116, 2007 | 65 | 2007 |
| Inferring termination conditions for logic programs using backwards analysis S Genaim, M Codish International Conference on Logic for Programming Artificial Intelligence …, 2001 | 63* | 2001 |
| May-happen-in-parallel based deadlock analysis for concurrent objects AE Flores-Montoya, E Albert, S Genaim Formal Techniques for Distributed Systems, 273-288, 2013 | 61 | 2013 |
| Ranking functions for linear-constraint loops AM Ben-Amram, S Genaim Journal of the ACM (JACM) 61 (4), 1-55, 2014 | 57 | 2014 |
| On the termination of integer loops AM Ben-Amram, S Genaim, AN Masud ACM Transactions on Programming Languages and Systems (TOPLAS) 34 (4), 1-24, 2012 | 56 | 2012 |
| Parametric inference of memory requirements for garbage collected languages E Albert, S Genaim, M Gómez-Zamalloa ACM Sigplan Notices 45 (8), 121-130, 2010 | 56 | 2010 |
| Live heap space analysis for languages with garbage collection E Albert, S Genaim, M Gómez-Zamalloa Gil Proceedings of the 2009 international symposium on Memory management, 129-138, 2009 | 51 | 2009 |
| On the limits of the classical approach to cost analysis DE Alonso-Blas, S Genaim International Static Analysis Symposium, 405-421, 2012 | 49 | 2012 |
| On the inference of resource usage upper and lower bounds E Albert, S Genaim, AN Masud ACM Transactions on Computational Logic (TOCL) 14 (3), 1-35, 2013 | 47 | 2013 |
