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
2582000
A unifying view of abstract domain design
G Filé, R Giacobazzi, F Ranzato
ACM Computing Surveys (CSUR) 28 (2), 333-336, 1996
911996
Optimal domains for disjunctive abstract interpretation
R Giacobazzi, F Ranzato
Science of Computer Programming 32 (1-3), 177-210, 1998
851998
Refining and compressing abstract domains
R Giacobazzi, F Ranzato
International Colloquium on Automata, Languages, and Programming, 771-781, 1997
851997
Complementation in abstract interpretation
A Cortesi, G Filé, F Ranzato, R Giacobazzi, C Palamidessi
ACM Transactions on Programming Languages and Systems (TOPLAS) 19 (1), 7-47, 1997
731997
A new efficient simulation equivalence algorithm
F Ranzato, F Tapparo
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 171-180, 2007
502007
Completeness in abstract interpretation: A domain perspective
R Giacobazzi, F Ranzato
International Conference on Algebraic Methodology and Software Technology …, 1997
501997
Improving Abstract Interpretations by Systematic Lifting to the Powerset.
G Filé, F Ranzato
GULP-PRODE (1), 357-371, 1994
471994
Strong preservation as completeness in abstract interpretation
F Ranzato, F Tapparo
European Symposium on Programming, 18-32, 2004
442004
The powerset operator on abstract interpretations
G Filé, F Ranzato
Theoretical Computer Science 222 (1-2), 77-111, 1999
421999
Weak relative pseudo-complements of closure operators
R Giacobazzi, C Palamidessi, F Ranzato
Algebra Universalis 36 (3), 405-412, 1996
411996
The reduced relative power operation on abstract domains
R Giacobazzi, F Ranzato
Theoretical Computer Science 216 (1-2), 159-211, 1999
401999
Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics.
R Giacobazzi, F Ranzato
ILPS, 321-335, 1995
381995
Generalizing the Paige–Tarjan algorithm by abstract interpretation
F Ranzato, F Tapparo
Information and Computation 206 (5), 620-651, 2008
372008
Generalized strong preservation by abstract interpretation
F Ranzato, F Tapparo
Journal of Logic and Computation 17 (1), 157-197, 2007
332007
The subgraph similarity problem
L De Nardo, F Ranzato, F Tapparo
IEEE Transactions on Knowledge and Data Engineering 21 (5), 748-749, 2008
312008
An efficient simulation algorithm based on abstract interpretation
F Ranzato, F Tapparo
Information and Computation 208 (1), 1-22, 2010
262010
Complementation of abstract domains made easy
M Maher
MIT Press, 1996
261996
Complete abstract interpretations made constructive
R Giacobazzi, F Ranzato, F Scozzari
International Symposium on Mathematical Foundations of Computer Science, 366-377, 1998
251998
Analyzing program analyses
R Giacobazzi, F Logozzo, F Ranzato
ACM SIGPLAN Notices 50 (1), 261-273, 2015
242015
The system can't perform the operation now. Try again later.
Articles 1–20