Francesco Ranzato

According to our database1, Francesco Ranzato
  • authored at least 67 papers between 1994 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
A Constructive Framework for Galois Connections.
CoRR, 2017

2016
An Abstract Interpretation-Based Model of Tracing Just-in-Time Compilation.
ACM Trans. Program. Lang. Syst., 2016

Abstract Interpretation of Supermodular Games.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

2015
Abstract Interpretation of Supermodular Games.
CoRR, 2015

A new characterization of complete Heyting and co-Heyting algebras.
CoRR, 2015

Analyzing Program Analyses.
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.
ACM Trans. Comput. Log., 2014

Correctness kernels of abstract interpretations.
Inf. Comput., 2014

An Abstract Interpretation-based Model of Tracing Just-In-Time Compilation.
CoRR, 2014

An efficient simulation algorithm on Kripke structures.
Acta Inf., 2014

Tracing compilation by abstract interpretation.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013
Complete Abstractions Everywhere.
Proceedings of the Verification, 2013

A More Efficient Simulation Algorithm on Kripke Structures.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation.
Formal Methods in System Design, 2012

A More Efficient Simulation Algorithm on Kripke Structures
CoRR, 2012

2011
Saving Space in a Time Efficient Simulation Algorithm.
Fundam. Inform., 2011

Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

A Spectrum of Behavioral Relations over LTSs on Probability Distributions.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
An efficient simulation algorithm based on abstract interpretation.
Inf. Comput., 2010

Example-Guided Abstraction Simplification.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming.
Proceedings of the A 25-Year Perspective on Logic Programming: Achievements of the Italian Association for Logic Programming, 2010

2009
The Subgraph Similarity Problem.
IEEE Trans. Knowl. Data Eng., 2009

Abstraction-Guided Abstraction Simplification
CoRR, 2009

Computing Stuttering Simulations
CoRR, 2009

Computing Stuttering Simulations.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Saving Space in a Time Efficient Simulation Algorithm.
Proceedings of the Ninth International Conference on Application of Concurrency to System Design, 2009

2008
Generalizing the Paige-Tarjan algorithm by abstract interpretation.
Inf. Comput., 2008

A Forward-Backward Abstraction Refinement Algorithm.
Proceedings of the Verification, 2008

2007
Generalized Strong Preservation by Abstract Interpretation.
J. Log. Comput., 2007

An efficient simulation equivalence algorithm based on abstract interpretation
CoRR, 2007

A New Efficient Simulation Equivalence Algorithm.
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.
Inf. Comput., 2006

Generalizing the Paige-Tarjan Algorithm by Abstract Interpretation
CoRR, 2006

Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation.
Proceedings of the Verification, 2006

2005
Making abstract domains condensing.
ACM Trans. Comput. Log., 2005

An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

An Abstract Interpretation Perspective on Linear vs. Branching Time.
Proceedings of the Programming Languages and Systems, Third Asian Symposium, 2005

2004
Incompleteness of States w.r.t. Traces in Model Checking
CoRR, 2004

Generalized Strong Preservation by Abstract Interpretation
CoRR, 2004

Strong Preservation as Completeness in Abstract Interpretation.
Proceedings of the Programming Languages and Systems, 2004

2002
Pseudocomplements of closure operators on posets.
Discrete Mathematics, 2002

Making Abstract Domains Condensing
CoRR, 2002

Making Abstract Model Checking Strongly Preserving.
Proceedings of the Static Analysis, 9th International Symposium, 2002

States vs. Traces in Model Checking by Abstract Interpretation.
Proceedings of the Static Analysis, 9th International Symposium, 2002

2001
On the Completeness of Model Checking.
Proceedings of the Programming Languages and Systems, 2001

2000
Making abstract interpretations complete.
J. ACM, 2000

1999
The Reduced Relative Power Operation on Abstract Domains.
Theor. Comput. Sci., 1999

The Powerset Operator on Abstract Interpretations.
Theor. Comput. Sci., 1999

Closures on CPOs Form Complete Lattices.
Inf. Comput., 1999

CPOs as Concrete Domains: Lattices of Abstract Domains and Complements.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998
Optimal Domains for Disjunctive Abstract Intepretation.
Sci. Comput. Program., 1998

Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements.
Inf. Comput., 1998

Building Complete Abstract Interpretations in a Linear Logic-based Setting.
Proceedings of the Static Analysis, 5th International Symposium, 1998

Complete Abstract Interpretations Made Constructive.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Building Complete Abstract Interpretations in a Linear Logic-based Setting.
Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

1997
Complementation in Abstract Interpretation.
ACM Trans. Program. Lang. Syst., 1997

Refining and Compressing Abstract Domains.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Completeness in Abstract Interpretation: A Domain Perspective.
Proceedings of the Algebraic Methodology and Software Technology, 1997

1996
A Unifying View of Abstract Domain Design.
ACM Comput. Surv., 1996

Complementation of Abstract Domains made Easy.
Proceedings of the Logic Programming, 1996

Compositional Optimization of Disjunctive Abstract Interpretations.
Proceedings of the Programming Languages and Systems, 1996

Complementing Logic Program Semantics.
Proceedings of the Algebraic and Logic Programming, 5th International Conference, 1996

Optimization of Disjunctive Abstract Interpretations.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995
Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics.
Proceedings of the Logic Programming, 1995

Complementation in Abstract Interpretation
Proceedings of the Static Analysis, 1995

1994
Improving Abstract Interpretations by Systematic Lifting to the Powerset.
Proceedings of the Logic Programming, 1994

Improving Abstract Interpretations by Systematic Lifting to the Powerset.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994


  Loading...