| Making abstract interpretations complete R Giacobazzi, F Ranzato, F Scozzari Journal of the ACM (JACM) 47 (2), 361-416, 2000 | 269 | 2000 |
| A unifying view of abstract domain design G Filé, R Giacobazzi, F Ranzato ACM Computing Surveys (CSUR) 28 (2), 333-336, 1996 | 91 | 1996 |
| Complementation in abstract interpretation A Cortesi, G File, F Ranzato, R Giacobazzi, C Palamidessi ACM Transactions on Programming Languages and Systems (TOPLAS) 19 (1), 7-47, 1997 | 88 | 1997 |
| Optimal domains for disjunctive abstract interpretation R Giacobazzi, F Ranzato Science of Computer Programming 32 (1-3), 177-210, 1998 | 87 | 1998 |
| Refining and compressing abstract domains R Giacobazzi, F Ranzato International Colloquium on Automata, Languages, and Programming, 771-781, 1997 | 84 | 1997 |
| A new efficient simulation equivalence algorithm F Ranzato, F Tapparo 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 171-180, 2007 | 56 | 2007 |
| Strong preservation as completeness in abstract interpretation F Ranzato, F Tapparo European Symposium on Programming, 18-32, 2004 | 56 | 2004 |
| Completeness in abstract interpretation: A domain perspective R Giacobazzi, F Ranzato International Conference on Algebraic Methodology and Software Technology …, 1997 | 56 | 1997 |
| Improving Abstract Interpretations by Systematic Lifting to the Powerset. G Filé, F Ranzato GULP-PRODE (1), 357-371, 1994 | 48 | 1994 |
| The powerset operator on abstract interpretations G Filé, F Ranzato Theoretical Computer Science 222 (1-2), 77-111, 1999 | 43 | 1999 |
| The reduced relative power operation on abstract domains R Giacobazzi, F Ranzato Theoretical Computer Science 216 (1-2), 159-211, 1999 | 41 | 1999 |
| Weak relative pseudo-complements of closure operators R Giacobazzi, C Palamidessi, F Ranzato Algebra Universalis 36 (3), 405-412, 1996 | 41 | 1996 |
| Generalizing the Paige–Tarjan algorithm by abstract interpretation F Ranzato, F Tapparo Information and Computation 206 (5), 620-651, 2008 | 38 | 2008 |
| Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics. R Giacobazzi, F Ranzato ILPS, 321-335, 1995 | 38 | 1995 |
| Generalized strong preservation by abstract interpretation F Ranzato, F Tapparo Journal of Logic and Computation 17 (1), 157-197, 2007 | 34 | 2007 |
| Analyzing program analyses R Giacobazzi, F Logozzo, F Ranzato ACM SIGPLAN Notices 50 (1), 261-273, 2015 | 33 | 2015 |
| An efficient simulation algorithm based on abstract interpretation F Ranzato, F Tapparo Information and Computation 208 (1), 1-22, 2010 | 31 | 2010 |
| The subgraph similarity problem L De Nardo, F Ranzato, F Tapparo IEEE Transactions on Knowledge and Data Engineering 21 (5), 748-749, 2008 | 30 | 2008 |
| Complementation of abstract domains made easy M Maher MIT Press, 1996 | 27 | 1996 |
| Making abstract domains condensing R Giacobazzi, F Ranzato, F Scozzari ACM Transactions on Computational Logic (TOCL) 6 (1), 33-60, 2005 | 25 | 2005 |
Roberto GiacobazziProfessor of Computer Science, University of VeronaVerified email at univr.it
