default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Ranzato
Person information
- affiliation: University of Padua, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j31]Roberto Giacobazzi
, Francesco Ranzato:
The Best of Abstract Interpretations. Proc. ACM Program. Lang. 9(POPL): 1355-1385 (2025)- 2024
- [j30]Nicolò Fassina, Francesco Ranzato, Marco Zanella:
Robustness verification of k-nearest neighbors by abstract interpretation. Knowl. Inf. Syst. 66(8): 4825-4859 (2024) - [c51]Pierre Ganty, Nicolas Manini, Francesco Ranzato:
Computing Reachable Simulations on Transition Systems. RP 2024: 21-37 - [c50]Abhinandan Pal, Francesco Ranzato, Caterina Urban, Marco Zanella:
Abstract Interpretation-Based Feature Importance for Support Vector Machines. VMCAI (1) 2024: 27-49 - 2023
- [j29]Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato:
A Correctness and Incorrectness Program Logic. J. ACM 70(2): 15:1-15:45 (2023) - [c49]Nicolò Fassina, Francesco Ranzato, Marco Zanella:
Robustness Certification of k-Nearest Neighbors. ICDM 2023: 110-119 - 2022
- [j28]Roberto Giacobazzi, Francesco Ranzato:
History of Abstract Interpretation. IEEE Ann. Hist. Comput. 44(2): 33-43 (2022) - [j27]Paolo Baldan, Francesco Ranzato, Linpeng Zhang:
Intensional Kleene and Rice theorems for abstract program semantics. Inf. Comput. 289(Part): 104953 (2022) - [c48]Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato:
Abstract interpretation repair. PLDI 2022: 426-441 - [c47]Marco Milanese, Francesco Ranzato:
Local Completeness Logic on Kleene Algebra with Tests. SAS 2022: 350-371 - [i21]Pierre Ganty, Nicolas Manini, Francesco Ranzato:
Online Simulation Reduction. CoRR abs/2204.11804 (2022) - [i20]Marco Milanese, Francesco Ranzato:
Local Completeness Logic on Kleene Algebra with Tests. CoRR abs/2205.08128 (2022) - [i19]Abhinandan Pal, Francesco Ranzato, Caterina Urban, Marco Zanella:
Abstract Interpretation-Based Feature Importance for SVMs. CoRR abs/2210.12456 (2022) - 2021
- [j26]Pierre Ganty, Francesco Ranzato, Pedro Valero:
Complete Abstractions for Checking Language Inclusion. ACM Trans. Comput. Log. 22(4): 22:1-22:40 (2021) - [c46]Francesco Ranzato, Caterina Urban, Marco Zanella:
Fairness-Aware Training of Decision Trees by Abstract Interpretation. CIKM 2021: 1508-1517 - [c45]Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato:
Inclusion Testing of Büchi Automata Based on Well-Quasiorders. CONCUR 2021: 3:1-3:22 - [c44]Francesco Ranzato, Marco Zanella:
Genetic adversarial training of decision trees. GECCO 2021: 358-367 - [c43]Paolo Baldan, Francesco Ranzato, Linpeng Zhang:
A Rice's Theorem for Abstract Semantics. ICALP 2021: 117:1-117:19 - [c42]Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato:
A Logic for Locally Complete Abstract Interpretations. LICS 2021: 1-13 - [i18]Francesco Ranzato, Caterina Urban, Marco Zanella:
Fair Training of Decision Tree Classifiers. CoRR abs/2101.00909 (2021) - [i17]Paolo Baldan, Francesco Ranzato, Linpeng Zhang:
A Rice's Theorem for Abstract Semantics. CoRR abs/2105.14579 (2021) - 2020
- [c41]Francesco Ranzato, Marco Zanella:
Abstract Interpretation of Decision Tree Ensemble Classifiers. AAAI 2020: 5478-5486 - [c40]Francesco Ranzato:
Decidability and Synthesis of Abstract Inductive Invariants. CONCUR 2020: 30:1-30:21 - [i16]Francesco Ranzato:
Decidability and Synthesis of Abstract Inductive Invariants. CoRR abs/2004.03170 (2020) - [i15]Francesco Ranzato, Marco Zanella:
Genetic Adversarial Training of Decision Trees. CoRR abs/2012.11352 (2020)
2010 – 2019
- 2019
- [j25]Francesco Ranzato:
Foreword to the special issue on the 2017 Static Analysis Symposium. Formal Methods Syst. Des. 54(1): 1-3 (2019) - [j24]Patrick Cousot, Roberto Giacobazzi, Francesco Ranzato:
A²I: abstract² interpretation. Proc. ACM Program. Lang. 3(POPL): 42:1-42:31 (2019) - [c39]Francesco Ranzato, Marco Zanella:
Robustness Verification of Decision Tree Ensembles. OVERLAY@AI*IA 2019: 59-64 - [c38]Pierre Ganty, Francesco Ranzato, Pedro Valero:
Language Inclusion Algorithms as Complete Abstract Interpretations. SAS 2019: 140-161 - [c37]Francesco Ranzato, Marco Zanella:
Robustness Verification of Support Vector Machines. SAS 2019: 271-295 - [i14]Pierre Ganty, Francesco Ranzato, Pedro Valero:
Complete Abstractions for Checking Language Inclusion. CoRR abs/1904.01388 (2019) - [i13]Francesco Ranzato, Marco Zanella:
Robustness Verification of Support Vector Machines. CoRR abs/1904.11803 (2019) - 2018
- [j23]Francesco Ranzato:
Abstracting Nash equilibria of supermodular games. Formal Methods Syst. Des. 53(2): 259-285 (2018) - [c36]Patrick Cousot, Roberto Giacobazzi, Francesco Ranzato:
Program Analysis Is Harder Than Verification: A Computability Perspective. CAV (2) 2018: 75-95 - [c35]Francesco Ranzato, Marco Zanella:
Invertible Linear Transforms of Numerical Abstract Domains. SAS 2018: 344-363 - [c34]Francesco Ranzato:
On Constructivity of Galois Connections. VMCAI 2018: 452-473 - 2017
- [j22]Francesco Ranzato:
A new characterization of complete Heyting and co-Heyting algebras. Log. Methods Comput. Sci. 13(3) (2017) - [e1]Francesco Ranzato:
Static Analysis - 24th International Symposium, SAS 2017, New York, NY, USA, August 30 - September 1, 2017, Proceedings. Lecture Notes in Computer Science 10422, Springer 2017, ISBN 978-3-319-66705-8 [contents] - [i12]Francesco Ranzato:
A Constructive Framework for Galois Connections. CoRR abs/1704.08909 (2017) - 2016
- [j21]Stefano Dissegna, Francesco Logozzo, Francesco Ranzato:
An Abstract Interpretation-Based Model of Tracing Just-in-Time Compilation. ACM Trans. Program. Lang. Syst. 38(2): 7:1-7:50 (2016) - [c33]Francesco Ranzato:
Abstract Interpretation of Supermodular Games. SAS 2016: 403-423 - 2015
- [c32]Roberto Giacobazzi, Francesco Logozzo, Francesco Ranzato:
Analyzing Program Analyses. POPL 2015: 261-273 - [i11]Francesco Ranzato:
A new characterization of complete Heyting and co-Heyting algebras. CoRR abs/1504.03919 (2015) - [i10]Francesco Ranzato:
Abstract Interpretation of Supermodular Games. CoRR abs/1507.01423 (2015) - 2014
- [j20]Francesco Ranzato:
An efficient simulation algorithm on Kripke structures. Acta Informatica 51(2): 107-125 (2014) - [j19]Roberto Giacobazzi, Francesco Ranzato:
Correctness kernels of abstract interpretations. Inf. Comput. 237: 187-203 (2014) - [j18]Silvia Crafa, Francesco Ranzato:
Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions. ACM Trans. Comput. Log. 16(1): 2:1-2:24 (2014) - [c31]Stefano Dissegna, Francesco Logozzo, Francesco Ranzato:
Tracing compilation by abstract interpretation. POPL 2014: 47-60 - [i9]Stefano Dissegna, Francesco Logozzo, Francesco Ranzato:
An Abstract Interpretation-based Model of Tracing Just-In-Time Compilation. CoRR abs/1411.7839 (2014) - 2013
- [c30]Francesco Ranzato:
A More Efficient Simulation Algorithm on Kripke Structures. MFCS 2013: 753-764 - [c29]Francesco Ranzato:
Complete Abstractions Everywhere. VMCAI 2013: 15-26 - 2012
- [j17]Silvia Crafa, Francesco Ranzato:
Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation. Formal Methods Syst. Des. 40(3): 356-376 (2012) - [i8]Francesco Ranzato:
A More Efficient Simulation Algorithm on Kripke Structures. CoRR abs/1212.1089 (2012) - 2011
- [j16]Silvia Crafa, Francesco Ranzato, Francesco Tapparo:
Saving Space in a Time Efficient Simulation Algorithm. Fundam. Informaticae 108(1-2): 23-42 (2011) - [c28]Silvia Crafa, Francesco Ranzato:
A Spectrum of Behavioral Relations over LTSs on Probability Distributions. CONCUR 2011: 124-139 - [c27]Silvia Crafa, Francesco Ranzato:
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation. ICALP (2) 2011: 295-306 - 2010
- [j15]Francesco Ranzato, Francesco Tapparo:
An efficient simulation algorithm based on abstract interpretation. Inf. Comput. 208(1): 1-22 (2010) - [c26]Roberto Giacobazzi, Francesco Ranzato:
Example-Guided Abstraction Simplification. ICALP (2) 2010: 211-222 - [p1]Giorgio Delzanno, Roberto Giacobazzi, Francesco Ranzato:
Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming. 25 Years GULP 2010: 136-158
2000 – 2009
- 2009
- [j14]Lorenzo De Nardo, Francesco Ranzato, Francesco Tapparo:
The Subgraph Similarity Problem. IEEE Trans. Knowl. Data Eng. 21(5): 748-749 (2009) - [c25]Silvia Crafa, Francesco Ranzato, Francesco Tapparo:
Saving Space in a Time Efficient Simulation Algorithm. ACSD 2009: 60-69 - [c24]Francesco Ranzato, Francesco Tapparo:
Computing Stuttering Simulations. CONCUR 2009: 542-556 - [i7]Francesco Ranzato, Francesco Tapparo:
Computing Stuttering Simulations. CoRR abs/0904.1488 (2009) - [i6]Roberto Giacobazzi, Francesco Ranzato:
Abstraction-Guided Abstraction Simplification. CoRR abs/0910.4748 (2009) - 2008
- [j13]Francesco Ranzato, Francesco Tapparo:
Generalizing the Paige-Tarjan algorithm by abstract interpretation. Inf. Comput. 206(5): 620-651 (2008) - [c23]Francesco Ranzato, Olivia Rossi-Doria, Francesco Tapparo:
A Forward-Backward Abstraction Refinement Algorithm. VMCAI 2008: 248-262 - 2007
- [j12]Francesco Ranzato, Francesco Tapparo:
Generalized Strong Preservation by Abstract Interpretation. J. Log. Comput. 17(1): 157-197 (2007) - [c22]Francesco Ranzato, Francesco Tapparo:
A New Efficient Simulation Equivalence Algorithm. LICS 2007: 171-180 - [i5]Francesco Ranzato, Francesco Tapparo:
An efficient simulation equivalence algorithm based on abstract interpretation. CoRR abs/0709.4118 (2007) - 2006
- [j11]Roberto Giacobazzi, Francesco Ranzato:
Incompleteness of states w.r.t. traces in model checking. Inf. Comput. 204(3): 376-407 (2006) - [c21]Francesco Ranzato, Francesco Tapparo:
Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation. VMCAI 2006: 332-347 - [i4]Francesco Ranzato, Francesco Tapparo:
Generalizing the Paige-Tarjan Algorithm by Abstract Interpretation. CoRR abs/cs/0612120 (2006) - 2005
- [j10]Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari:
Making abstract domains condensing. ACM Trans. Comput. Log. 6(1): 33-60 (2005) - [c20]Francesco Ranzato, Francesco Tapparo:
An Abstract Interpretation Perspective on Linear vs. Branching Time. APLAS 2005: 69-85 - [c19]Francesco Ranzato, Francesco Tapparo:
An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation. TACAS 2005: 140-156 - 2004
- [c18]Francesco Ranzato, Francesco Tapparo:
Strong Preservation as Completeness in Abstract Interpretation. ESOP 2004: 18-32 - [i3]Francesco Ranzato, Francesco Tapparo:
Generalized Strong Preservation by Abstract Interpretation. CoRR cs.LO/0401016 (2004) - [i2]Roberto Giacobazzi, Francesco Ranzato:
Incompleteness of States w.r.t. Traces in Model Checking. CoRR cs.LO/0404048 (2004) - 2002
- [j9]Francesco Ranzato:
Pseudocomplements of closure operators on posets. Discret. Math. 248(1-3): 143-155 (2002) - [c17]Francesco Ranzato, Francesco Tapparo:
Making Abstract Model Checking Strongly Preserving. SAS 2002: 411-427 - [c16]Roberto Giacobazzi, Francesco Ranzato:
States vs. Traces in Model Checking by Abstract Interpretation. SAS 2002: 461-476 - [i1]Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari:
Making Abstract Domains Condensing. CoRR cs.PL/0204016 (2002) - 2001
- [c15]Francesco Ranzato:
On the Completeness of Model Checking. ESOP 2001: 137-154 - 2000
- [j8]Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari:
Making abstract interpretations complete. J. ACM 47(2): 361-416 (2000)
1990 – 1999
- 1999
- [j7]Francesco Ranzato:
Closures on CPOs Form Complete Lattices. Inf. Comput. 152(2): 236-249 (1999) - [j6]Roberto Giacobazzi, Francesco Ranzato:
The Reduced Relative Power Operation on Abstract Domains. Theor. Comput. Sci. 216(1-2): 159-211 (1999) - [j5]Gilberto Filé, Francesco Ranzato:
The Powerset Operator on Abstract Interpretations. Theor. Comput. Sci. 222(1-2): 77-111 (1999) - [c14]Francesco Ranzato:
CPOs as Concrete Domains: Lattices of Abstract Domains and Complements. APPIA-GULP-PRODE 1999: 183-196 - 1998
- [j4]Roberto Giacobazzi, Francesco Ranzato:
Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements. Inf. Comput. 145(2): 153-190 (1998) - [j3]Roberto Giacobazzi, Francesco Ranzato:
Optimal Domains for Disjunctive Abstract Intepretation. Sci. Comput. Program. 32(1-3): 177-210 (1998) - [c13]Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari:
Building Complete Abstract Interpretations in a Linear Logic-based Setting. APPIA-GULP-PRODE 1998: 241-254 - [c12]Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari:
Complete Abstract Interpretations Made Constructive. MFCS 1998: 366-377 - [c11]Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari:
Building Complete Abstract Interpretations in a Linear Logic-based Setting. SAS 1998: 215-229 - 1997
- [j2]Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato:
Complementation in Abstract Interpretation. ACM Trans. Program. Lang. Syst. 19(1): 7-47 (1997) - [c10]Roberto Giacobazzi, Francesco Ranzato:
Completeness in Abstract Interpretation: A Domain Perspective. AMAST 1997: 231-245 - [c9]Roberto Giacobazzi, Francesco Ranzato:
Refining and Compressing Abstract Domains. ICALP 1997: 771-781 - 1996
- [j1]Gilberto Filé, Roberto Giacobazzi, Francesco Ranzato:
A Unifying View of Abstract Domain Design. ACM Comput. Surv. 28(2): 333-336 (1996) - [c8]Roberto Giacobazzi, Francesco Ranzato:
Optimization of Disjunctive Abstract Interpretations. APPIA-GULP-PRODE 1996: 53-66 - [c7]Roberto Giacobazzi, Francesco Ranzato:
Complementing Logic Program Semantics. ALP 1996: 238-253 - [c6]Roberto Giacobazzi, Francesco Ranzato:
Compositional Optimization of Disjunctive Abstract Interpretations. ESOP 1996: 141-155 - [c5]Gilberto Filé, Francesco Ranzato:
Complementation of Abstract Domains made Easy. JICSLP 1996: 348-362 - 1995
- [c4]Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato:
Complementation in Abstract Interpretation. SAS 1995: 100-117 - [c3]Roberto Giacobazzi, Francesco Ranzato:
Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics. ILPS 1995: 321-335 - 1994
- [c2]Gilberto Filé, Francesco Ranzato:
Improving Abstract Interpretations by Systematic Lifting to the Powerset. GULP-PRODE (1) 1994: 357-371 - [c1]Gilberto Filé, Francesco Ranzato:
Improving Abstract Interpretations by Systematic Lifting to the Powerset. ILPS 1994: 655-669
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
