Improving Abstract Interpretations by Systematic Lifting to the Powerset. - Gilberto Filé; Francesco Ranzato (GULP-PRODE (1), 1994)

Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics. - Roberto Giacobazzi; Francesco Ranzato (ILPS, 1995)

Optimization of Disjunctive Abstract Interpretations. - Roberto Giacobazzi; Francesco Ranzato (APPIA-GULP-PRODE, 1996)

Complementing Logic Program Semantics. - Roberto Giacobazzi; Francesco Ranzato (ALP, 1996)

Compositional Optimization of Disjunctive Abstract Interpretations. - Roberto Giacobazzi; Francesco Ranzato (ESOP, 1996)

Complementation of Abstract Domains made Easy. - Gilberto Filé; Francesco Ranzato (JICSLP, 1996)

A Unifying View of Abstract Domain Design. - Gilberto Filé; Roberto Giacobazzi; Francesco Ranzato (ACM Comput. Surv., 1996)

Completeness in Abstract Interpretation: A Domain Perspective. - Roberto Giacobazzi; Francesco Ranzato (AMAST, 1997)

Refining and Compressing Abstract Domains. - Roberto Giacobazzi; Francesco Ranzato (ICALP, 1997)

Complementation in Abstract Interpretation. - Agostino Cortesi; Gilberto Filé; Roberto Giacobazzi; Catuscia Palamidessi; Francesco Ranzato (ACM Trans. Program. Lang. Syst., 1997)

Building Complete Abstract Interpretations in a Linear Logic-based Setting. - Roberto Giacobazzi; Francesco Ranzato; Francesca Scozzari (APPIA-GULP-PRODE, 1998)

Complete Abstract Interpretations Made Constructive. - Roberto Giacobazzi; Francesco Ranzato; Francesca Scozzari (MFCS, 1998)

Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements. - Roberto Giacobazzi; Francesco Ranzato (Inf. Comput., 1998)

Optimal Domains for Disjunctive Abstract Intepretation. - Roberto Giacobazzi; Francesco Ranzato (Sci. Comput. Program., 1998)

CPOs as Concrete Domains: Lattices of Abstract Domains and Complements. - Francesco Ranzato (APPIA-GULP-PRODE, 1999)

Closures on CPOs Form Complete Lattices. - Francesco Ranzato (Inf. Comput., 1999)

The Powerset Operator on Abstract Interpretations. - Gilberto Filé; Francesco Ranzato (Theor. Comput. Sci., 1999)

The Reduced Relative Power Operation on Abstract Domains. - Roberto Giacobazzi; Francesco Ranzato (Theor. Comput. Sci., 1999)

Making abstract interpretations complete. - Roberto Giacobazzi; Francesco Ranzato; Francesca Scozzari (J. ACM, 2000)

On the Completeness of Model Checking. - Francesco Ranzato (ESOP, 2001)

States vs. Traces in Model Checking by Abstract Interpretation. - Roberto Giacobazzi; Francesco Ranzato (SAS, 2002)

Making Abstract Model Checking Strongly Preserving. - Francesco Ranzato; Francesco Tapparo (SAS, 2002)

Pseudocomplements of closure operators on posets. - Francesco Ranzato (Discret. Math., 2002)

Strong Preservation as Completeness in Abstract Interpretation. - Francesco Ranzato; Francesco Tapparo (ESOP, 2004)

An Abstract Interpretation Perspective on Linear vs. Branching Time. - Francesco Ranzato; Francesco Tapparo (APLAS, 2005)

An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation. - Francesco Ranzato; Francesco Tapparo (TACAS, 2005)

Making abstract domains condensing. - Roberto Giacobazzi; Francesco Ranzato; Francesca Scozzari (ACM Trans. Comput. Log., 2005)

Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation. - Francesco Ranzato; Francesco Tapparo (VMCAI, 2006)

Incompleteness of states w.r.t. traces in model checking. - Roberto Giacobazzi; Francesco Ranzato (Inf. Comput., 2006)

A New Efficient Simulation Equivalence Algorithm. - Francesco Ranzato; Francesco Tapparo (LICS, 2007)

An efficient simulation equivalence algorithm based on abstract interpretation - Francesco Ranzato; Francesco Tapparo (CoRR, 2007)

Generalized Strong Preservation by Abstract Interpretation. - Francesco Ranzato; Francesco Tapparo (J. Log. Comput., 2007)

A Forward-Backward Abstraction Refinement Algorithm. - Francesco Ranzato; Olivia Rossi-Doria; Francesco Tapparo (VMCAI, 2008)

Generalizing the Paige-Tarjan algorithm by abstract interpretation. - Francesco Ranzato; Francesco Tapparo (Inf. Comput., 2008)

Computing Stuttering Simulations. - Francesco Ranzato; Francesco Tapparo (CONCUR, 2009)

Abstraction-Guided Abstraction Simplification - Roberto Giacobazzi; Francesco Ranzato (CoRR, 2009)

The Subgraph Similarity Problem. - Lorenzo De Nardo; Francesco Ranzato; Francesco Tapparo (IEEE Trans. Knowl. Data Eng., 2009)

Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming. - Giorgio Delzanno; Roberto Giacobazzi; Francesco Ranzato (25 Years GULP, 2010)

Example-Guided Abstraction Simplification. - Roberto Giacobazzi; Francesco Ranzato (ICALP (2), 2010)

An efficient simulation algorithm based on abstract interpretation. - Francesco Ranzato; Francesco Tapparo (Inf. Comput., 2010)

A Spectrum of Behavioral Relations over LTSs on Probability Distributions. - Silvia Crafa; Francesco Ranzato (CONCUR, 2011)

Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation. - Silvia Crafa; Francesco Ranzato (ICALP (2), 2011)

Saving Space in a Time Efficient Simulation Algorithm. - Silvia Crafa; Francesco Ranzato; Francesco Tapparo (Fundam. Informaticae, 2011)

Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation. - Silvia Crafa; Francesco Ranzato (Formal Methods Syst. Des., 2012)

A More Efficient Simulation Algorithm on Kripke Structures. - Francesco Ranzato (MFCS, 2013)

Complete Abstractions Everywhere. - Francesco Ranzato (VMCAI, 2013)

Tracing compilation by abstract interpretation. - Stefano Dissegna; Francesco Logozzo; Francesco Ranzato (POPL, 2014)

An efficient simulation algorithm on Kripke structures. - Francesco Ranzato (Acta Informatica, 2014)

Correctness kernels of abstract interpretations. - Roberto Giacobazzi; Francesco Ranzato (Inf. Comput., 2014)

Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions. - Silvia Crafa; Francesco Ranzato (ACM Trans. Comput. Log., 2014)

Analyzing Program Analyses. - Roberto Giacobazzi; Francesco Logozzo; Francesco Ranzato (POPL, 2015)

Abstract Interpretation of Supermodular Games. - Francesco Ranzato (SAS, 2016)

An Abstract Interpretation-Based Model of Tracing Just-in-Time Compilation. - Stefano Dissegna; Francesco Logozzo; Francesco Ranzato (ACM Trans. Program. Lang. Syst., 2016)

A Constructive Framework for Galois Connections. - Francesco Ranzato (CoRR, 2017)

A new characterization of complete Heyting and co-Heyting algebras. - Francesco Ranzato (Log. Methods Comput. Sci., 2017)

Program Analysis Is Harder Than Verification: A Computability Perspective. - Patrick Cousot; Roberto Giacobazzi; Francesco Ranzato (CAV (2), 2018)

Invertible Linear Transforms of Numerical Abstract Domains. - Francesco Ranzato; Marco Zanella (SAS, 2018)

On Constructivity of Galois Connections. - Francesco Ranzato (VMCAI, 2018)

Abstracting Nash equilibria of supermodular games. - Francesco Ranzato (Formal Methods Syst. Des., 2018)

Robustness Verification of Decision Tree Ensembles. - Francesco Ranzato; Marco Zanella (OVERLAY@AI*IA, 2019)

Language Inclusion Algorithms as Complete Abstract Interpretations. - Pierre Ganty; Francesco Ranzato; Pedro Valero 001 (SAS, 2019)

Robustness Verification of Support Vector Machines. - Francesco Ranzato; Marco Zanella (SAS, 2019)

Foreword to the special issue on the 2017 Static Analysis Symposium. - Francesco Ranzato (Formal Methods Syst. Des., 2019)

A²I: abstract² interpretation. - Patrick Cousot; Roberto Giacobazzi; Francesco Ranzato (Proc. ACM Program. Lang., 2019)

Abstract Interpretation of Decision Tree Ensemble Classifiers. - Francesco Ranzato; Marco Zanella (AAAI, 2020)

Decidability and Synthesis of Abstract Inductive Invariants. - Francesco Ranzato (CONCUR, 2020)

Fairness-Aware Training of Decision Trees by Abstract Interpretation. - Francesco Ranzato; Caterina Urban; Marco Zanella (CIKM, 2021)

Inclusion Testing of Büchi Automata Based on Well-Quasiorders. - Kyveli Doveri; Pierre Ganty; Francesco Parolini; Francesco Ranzato (CONCUR, 2021)

Genetic adversarial training of decision trees. - Francesco Ranzato; Marco Zanella (GECCO, 2021)

A Rice's Theorem for Abstract Semantics. - Paolo Baldan; Francesco Ranzato; Linpeng Zhang (ICALP, 2021)

A Logic for Locally Complete Abstract Interpretations. - Roberto Bruni 001; Roberto Giacobazzi; Roberta Gori; Francesco Ranzato (LICS, 2021)

Fair Training of Decision Tree Classifiers. - Francesco Ranzato; Caterina Urban; Marco Zanella (CoRR, 2021)

Complete Abstractions for Checking Language Inclusion. - Pierre Ganty; Francesco Ranzato; Pedro Valero 001 (ACM Trans. Comput. Log., 2021)

Abstract interpretation repair. - Roberto Bruni 001; Roberto Giacobazzi; Roberta Gori; Francesco Ranzato (PLDI, 2022)

Local Completeness Logic on Kleene Algebra with Tests. - Marco Milanese; Francesco Ranzato (SAS, 2022)

History of Abstract Interpretation. - Roberto Giacobazzi; Francesco Ranzato (IEEE Ann. Hist. Comput., 2022)

Online Simulation Reduction. - Pierre Ganty; Nicolas Manini; Francesco Ranzato (CoRR, 2022)

Abstract Interpretation-Based Feature Importance for SVMs. - Abhinandan Pal; Francesco Ranzato; Caterina Urban; Marco Zanella (CoRR, 2022)

Intensional Kleene and Rice theorems for abstract program semantics. - Paolo Baldan; Francesco Ranzato; Linpeng Zhang (Inf. Comput., 2022)

Robustness Certification of k-Nearest Neighbors. - Nicolò Fassina; Francesco Ranzato; Marco Zanella (ICDM, 2023)

Local Completeness in Abstract Interpretation. - Roberto Bruni 001; Roberto Giacobazzi; Roberta Gori; Francesco Ranzato (Challenges of Software Verification, 2023)

A Correctness and Incorrectness Program Logic. - Roberto Bruni 001; Roberto Giacobazzi; Roberta Gori; Francesco Ranzato (J. ACM, 2023)

Computing Reachable Simulations on Transition Systems. - Pierre Ganty; Nicolas Manini; Francesco Ranzato (RP, 2024)

Abstract Interpretation-Based Feature Importance for Support Vector Machines. - Abhinandan Pal; Francesco Ranzato; Caterina Urban; Marco Zanella (VMCAI (1), 2024)

Robustness verification of k-nearest neighbors by abstract interpretation. - Nicolò Fassina; Francesco Ranzato; Marco Zanella (Knowl. Inf. Syst., 2024)

Model Checking as Program Verification by Abstract Interpretation. - Paolo Baldan; Roberto Bruni 001; Francesco Ranzato; Diletta Rigo (CONCUR, 2025)

The Best of Abstract Interpretations. - Roberto Giacobazzi; Francesco Ranzato (Proc. ACM Program. Lang., 2025)

Model Checking as Program Verification by Abstract Interpretation (Extended Version). - Paolo Baldan; Roberto Bruni 001; Francesco Ranzato; Diletta Rigo (CoRR, 2025)

The Reachable Simulation Problem. - Pierre Ganty; Nicolas Manini; Francesco Ranzato (ACM Trans. Comput. Log., 2025)