Follow
Francesco Ranzato
Francesco Ranzato
Professor of Computer Science, University of Padova, Italy
Verified email at math.unipd.it - Homepage
Title
Cited by
Cited by
Year
Making abstract interpretations complete
R Giacobazzi, F Ranzato, F Scozzari
Journal of the ACM (JACM) 47 (2), 361-416, 2000
3012000
A unifying view of abstract domain design
G Filé, R Giacobazzi, F Ranzato
ACM Computing Surveys (CSUR) 28 (2), 333-336, 1996
971996
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
921997
Refining and compressing abstract domains
R Giacobazzi, F Ranzato
International Colloquium on Automata, Languages, and Programming, 771-781, 1997
891997
Optimal domains for disjunctive abstract interpretation
R Giacobazzi, F Ranzato
Science of Computer Programming 32 (1-3), 177-210, 1998
881998
Completeness in abstract interpretation: A domain perspective
R Giacobazzi, F Ranzato
International Conference on Algebraic Methodology and Software Technology …, 1997
621997
Strong preservation as completeness in abstract interpretation
F Ranzato, F Tapparo
Programming Languages and Systems: 13th European Symposium on Programming …, 2004
592004
A new efficient simulation equivalence algorithm
F Ranzato, F Tapparo
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 171-180, 2007
542007
Analyzing program analyses
R Giacobazzi, F Logozzo, F Ranzato
ACM SIGPLAN Notices 50 (1), 261-273, 2015
492015
The powerset operator on abstract interpretations
G Filé, F Ranzato
Theoretical Computer Science 222 (1-2), 77-111, 1999
491999
Improving Abstract Interpretations by Systematic Lifting to the Powerset.
G Filé, F Ranzato
GULP-PRODE (1), 357-371, 1994
491994
Abstract interpretation of decision tree ensemble classifiers
F Ranzato, M Zanella
Proceedings of the AAAI Conference on Artificial Intelligence 34 (04), 5478-5486, 2020
472020
The reduced relative power operation on abstract domains
R Giacobazzi, F Ranzato
Theoretical Computer Science 216 (1-2), 159-211, 1999
441999
Weak relative pseudo-complements of closure operators
R Giacobazzi, C Palamidessi, F Ranzato
Algebra Universalis 36, 405-412, 1996
421996
Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics.
R Giacobazzi, F Ranzato
ILPS, 321-335, 1995
401995
Generalizing the Paige–Tarjan algorithm by abstract interpretation
F Ranzato, F Tapparo
Information and Computation 206 (5), 620-651, 2008
382008
Generalized strong preservation by abstract interpretation
F Ranzato, F Tapparo
Journal of Logic and Computation 17 (1), 157-197, 2007
362007
An efficient simulation algorithm based on abstract interpretation
F Ranzato, F Tapparo
Information and Computation 208 (1), 1-22, 2010
342010
A logic for locally complete abstract interpretations
R Bruni, R Giacobazzi, R Gori, F Ranzato
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021
332021
The subgraph similarity problem
L De Nardo, F Ranzato, F Tapparo
IEEE Transactions on Knowledge and Data Engineering 21 (5), 748-749, 2008
322008
The system can't perform the operation now. Try again later.
Articles 1–20