Enea Zaffanella

According to our database1, Enea Zaffanella authored at least 59 papers between 1994 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Revisiting Polyhedral Analysis for Hybrid Systems.
Proceedings of the Static Analysis - 26th International Symposium, 2019

ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.
Proceedings of the ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systemsi, 2019

2018
On the Efficiency of Convex Polyhedra.
Electr. Notes Theor. Comput. Sci., 2018

An Efficient Abstract Domain for Not Necessarily Closed Polyhedra.
Proceedings of the Static Analysis - 25th International Symposium, 2018

A Direct Encoding for NNC Polyhedra.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

ARCH-COMP18 Category Report: Hybrid Systems with Piecewise Constant Dynamics.
Proceedings of the ARCH18. 5th International Workshop on Applied Verification of Continuous and Hybrid Systems, 2018

2017
A Conversion Procedure for NNC Polyhedra.
CoRR, 2017

2014
Efficient Constraint/Generator Removal from Double Description of Polyhedra.
Electr. Notes Theor. Comput. Sci., 2014

2012
A new look at the automatic synthesis of linear ranking functions.
Inf. Comput., 2012

2010
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
CoRR, 2010

Exact join detection for convex polyhedra and other numerical abstractions.
Comput. Geom., 2010

2009
Applications of polyhedral computations to the analysis and verification of hardware and software systems.
Theor. Comput. Sci., 2009

Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness.
Formal Methods in System Design, 2009

Exact Join Detection for Convex Polyhedra and Other Numerical Abstractions
CoRR, 2009

2008
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems.
Sci. Comput. Program., 2008

An Improved Tight Closure Algorithm for Integer Octagonal Constraints.
Proceedings of the Verification, 2008

2007
Widening operators for powerset domains.
STTT, 2007

On the Design of Generic Static Analyzers for Modern Imperative Languages
CoRR, 2007

Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems
CoRR, 2007

A Prolog-based Environment for Reasoning about Programming Languages (Extended abstract)
CoRR, 2007

An Improved Tight Closure Algorithm for Integer Octagonal Constraints
CoRR, 2007

2006
The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Verification of Hardware and Software Systems
CoRR, 2006

Grids: A Domain for Analyzing the Distribution of Numerical Values.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2006

2005
Enhanced sharing analysis techniques: a comprehensive evaluation.
TPLP, 2005

Precise widening operators for convex polyhedra.
Sci. Comput. Program., 2005

Not necessarily closed convex polyhedra and the double description method.
Formal Asp. Comput., 2005

PURRS: Towards Computer Algebra Support for Fully Automatic Worst-Case Complexity Analysis
CoRR, 2005

Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra.
Proceedings of the Static Analysis, 12th International Symposium, 2005

Widening Operators for Weakly-Relational Numeric Abstractions.
Proceedings of the Static Analysis, 12th International Symposium, 2005

2004
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages.
TPLP, 2004

Finite-tree analysis for constraint logic-based languages.
Inf. Comput., 2004

Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
CoRR, 2004

Enhanced sharing analysis techniques: a comprehensive evaluation
CoRR, 2004

A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
CoRR, 2004

Widening Operators for Weakly-Relational Numeric Abstractions (Extended Abstract)
CoRR, 2004

Widening Operators for Powerset Domains.
Proceedings of the Verification, 2004

2003
Precise Widening Operators for Convex Polyhedra.
Proceedings of the Static Analysis, 10th International Symposium, 2003

2002
Decomposing non-redundant sharing by complementation.
TPLP, 2002

Soundness, idempotence and commutativity of set-sharing.
TPLP, 2002

Set-sharing is redundant for pair-sharing.
Theor. Comput. Sci., 2002

Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library.
Proceedings of the Static Analysis, 9th International Symposium, 2002

2001
Correctness, precision and efficiency in the sharing analysis of real logic languages.
PhD thesis, 2001

Soundness, Idempotence and Commutativity of Set-Sharing
CoRR, 2001

Decomposing Non-Redundant Sharing by Complementation
CoRR, 2001

Finite-Tree Analysis for Constraint Logic-Based Languages.
Proceedings of the Static Analysis, 8th International Symposium, 2001

Boolean functions for finite-tree dependencies.
Proceedings of the APPIA-GULP-PRODE 2001: Joint Conference on Declarative Programming, 2001

2000
Enhanced sharing analysis techniques: a comprehensive evaluation.
Proceedings of the 2nd international ACM SIGPLAN conference on on Principles and practice of declarative programming, 2000

Efficient Structural Information Analysis for Real CLP Languages.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999
Decomposing Non-redundant Sharing by Complementation.
Proceedings of the Static Analysis, 6th International Symposium, 1999

Widening Sharing.
Proceedings of the Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29, 1999

Enhancing Sharing for Precision.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998
The Correctness of Set-Sharing.
Proceedings of the Static Analysis, 5th International Symposium, 1998

1997
Abstracting Synchronization in Concurrent Constraint Programming.
Journal of Functional and Logic Programming, 1997

Set-Sharing is Redundant for Pair-Sharing.
Proceedings of the Static Analysis, 4th International Symposium, 1997

Sharing Revisited.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996
Modular Analysis of Suspension Free cc Programs.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

The And-compositionality of CLP Computed Answer Constraints.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995
Domain Independent Ask Approximation in CCP.
Proceedings of the Principles and Practice of Constraint Programming, 1995

1994
Abstracting Synchronization in Concurrent Constraint Programming.
Proceedings of the ICLP 1994 Workshop W2: Verification and Analysis of (Concurrent) Logic Languages, 1994


  Loading...