Francesco Ranzato

Pedro Valero

ACM Trans. Comput. Log., 2021

Fair Training of Decision Tree Classifiers.

[BibT_eX]

[DOI]

Caterina Urban

CoRR, 2021

A Logic for Locally Complete Abstract Interpretations.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

A Rice's Theorem for Abstract Semantics.

[BibT_eX]

[DOI]

Paolo Baldan

Linpeng Zhang

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Genetic adversarial training of decision trees.

[BibT_eX]

[DOI]

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Inclusion Testing of Büchi Automata Based on Well-Quasiorders.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Fairness-Aware Training of Decision Trees by Abstract Interpretation.

[BibT_eX]

[DOI]

Caterina Urban

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020

Decidability and Synthesis of Abstract Inductive Invariants.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

Abstract Interpretation of Decision Tree Ensemble Classifiers.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

A²I: abstract² interpretation.

[BibT_eX]

[DOI]

Patrick Cousot

Proc. ACM Program. Lang., 2019

Foreword to the special issue on the 2017 Static Analysis Symposium.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2019

Robustness Verification of Support Vector Machines.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 26th International Symposium, 2019

Language Inclusion Algorithms as Complete Abstract Interpretations.

[BibT_eX]

[DOI]

Pierre Ganty

Pedro Valero

Proceedings of the Static Analysis - 26th International Symposium, 2019

Robustness Verification of Decision Tree Ensembles.

[BibT_eX]

[DOI]

Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, 2019

2018

Abstracting Nash equilibria of supermodular games.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2018

On Constructivity of Galois Connections.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Invertible Linear Transforms of Numerical Abstract Domains.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 25th International Symposium, 2018

Program Analysis Is Harder Than Verification: A Computability Perspective.

[BibT_eX]

[DOI]

Patrick Cousot

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017

A new characterization of complete Heyting and co-Heyting algebras.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

A Constructive Framework for Galois Connections.

[BibT_eX]

[DOI]

CoRR, 2017

2016

An Abstract Interpretation-Based Model of Tracing Just-in-Time Compilation.

[BibT_eX]

[DOI]

Stefano Dissegna

Francesco Logozzo

ACM Trans. Program. Lang. Syst., 2016

Abstract Interpretation of Supermodular Games.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 23rd International Symposium, 2016

2015

Analyzing Program Analyses.

[BibT_eX]

[DOI]

Francesco Logozzo

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

2014

Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2014

Correctness kernels of abstract interpretations.

[BibT_eX]

[DOI]

Inf. Comput., 2014

An efficient simulation algorithm on Kripke structures.

[BibT_eX]

[DOI]

Acta Informatica, 2014

Tracing compilation by abstract interpretation.

[BibT_eX]

[DOI]

Stefano Dissegna

Francesco Logozzo

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013

Complete Abstractions Everywhere.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2013

A More Efficient Simulation Algorithm on Kripke Structures.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2012

2011

Saving Space in a Time Efficient Simulation Algorithm.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

A Spectrum of Behavioral Relations over LTSs on Probability Distributions.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010

An efficient simulation algorithm based on abstract interpretation.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Example-Guided Abstraction Simplification.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming.

[BibT_eX]

[DOI]

Giorgio Delzanno

Proceedings of the A 25-Year Perspective on Logic Programming: Achievements of the Italian Association for Logic Programming, 2010

2009

The Subgraph Similarity Problem.

[BibT_eX]

[DOI]

Lorenzo De Nardo

IEEE Trans. Knowl. Data Eng., 2009

Abstraction-Guided Abstraction Simplification

[BibT_eX]

[DOI]

CoRR, 2009

Computing Stuttering Simulations.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Generalizing the Paige-Tarjan algorithm by abstract interpretation.

[BibT_eX]

[DOI]

Inf. Comput., 2008

A Forward-Backward Abstraction Refinement Algorithm.

[BibT_eX]

[DOI]

Olivia Rossi-Doria

Proceedings of the Verification, 2008

2007

Generalized Strong Preservation by Abstract Interpretation.

[BibT_eX]

[DOI]

J. Log. Comput., 2007

An efficient simulation equivalence algorithm based on abstract interpretation

[BibT_eX]

[DOI]

CoRR, 2007

A New Efficient Simulation Equivalence Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006

Incompleteness of states w.r.t. traces in model checking.

[BibT_eX]

[DOI]

Inf. Comput., 2006

Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2006

2005

Making abstract domains condensing.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2005

An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

An Abstract Interpretation Perspective on Linear vs. Branching Time.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, Third Asian Symposium, 2005

2004

Strong Preservation as Completeness in Abstract Interpretation.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2004

2002

Pseudocomplements of closure operators on posets.

[BibT_eX]

[DOI]

Discret. Math., 2002

Making Abstract Model Checking Strongly Preserving.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 9th International Symposium, 2002

States vs. Traces in Model Checking by Abstract Interpretation.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 9th International Symposium, 2002

2001

On the Completeness of Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2001

2000

Making abstract interpretations complete.

[BibT_eX]

[DOI]

J. ACM, 2000

1999

The Reduced Relative Power Operation on Abstract Domains.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

The Powerset Operator on Abstract Interpretations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Closures on CPOs Form Complete Lattices.

[BibT_eX]

[DOI]

Inf. Comput., 1999

CPOs as Concrete Domains: Lattices of Abstract Domains and Complements.

[BibT_eX]

Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998

Optimal Domains for Disjunctive Abstract Intepretation.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1998

Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements.

[BibT_eX]

[DOI]

Inf. Comput., 1998

Complete Abstract Interpretations Made Constructive.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Building Complete Abstract Interpretations in a Linear Logic-based Setting.

[BibT_eX]

Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

1997

Complementation in Abstract Interpretation.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1997

Refining and Compressing Abstract Domains.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Completeness in Abstract Interpretation: A Domain Perspective.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1997

1996

A Unifying View of Abstract Domain Design.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

Complementation of Abstract Domains made Easy.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 1996

Compositional Optimization of Disjunctive Abstract Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 1996

Complementing Logic Program Semantics.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 5th International Conference, 1996

Optimization of Disjunctive Abstract Interpretations.

[BibT_eX]

Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995

Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 1995

1994

Improving Abstract Interpretations by Systematic Lifting to the Powerset.

[BibT_eX]