Enea Zaffanella

Orcid: 0000-0001-6388-2053

Affiliations:
  • University of Parma, Italy


According to our database1, Enea Zaffanella authored at least 55 papers between 1995 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Speeding up static analysis with the split operator.
Int. J. Softw. Tools Technol. Transf., October, 2024

P-stable abstractions of hybrid systems.
Softw. Syst. Model., April, 2024

Towards a Sound Construction of EVM Bytecode Control-Flow Graphs.
Proceedings of the 26th ACM International Workshop on Formal Techniques for Java-like Programs, 2024

2023
Unconstrained Variable Oracles for Faster Numeric Static Analyses.
Proceedings of the Static Analysis - 30th International Symposium, 2023

2022
Symbolic Analysis of Linear Hybrid Automata - 25 Years Later.
Proceedings of the Principles of Systems Design, 2022

ARCH-COMP22 Category Report: Hybrid Systems with Piecewise Constant Dynamics and Bounded Model Checking.
Proceedings of 9th International Workshop on Applied Verification of Continuous and Hybrid Systems (ARCH22), 2022

Decoupling the Ascending and Descending Phases in Abstract Interpretation.
Proceedings of the Programming Languages and Systems - 20th Asian Symposium, 2022

2021
Reverse engineering with P-stable Abstractions.
Proceedings of the 3rd Workshop on Artificial Intelligence and Formal Verification, 2021

2020
PPLite: Zero-overhead encoding of NNC polyhedra.
Inf. Comput., 2020

Synthesis of P-Stable Abstractions.
Proceedings of the Software Engineering and Formal Methods - 18th International Conference, 2020

ARCH-COMP20 Category Report: Hybrid Systems with Piecewise Constant Dynamics and Bounded Model Checking.
Proceedings of the ARCH20. 7th International Workshop on Applied Verification of Continuous and Hybrid Systems (ARCH20), 2020

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
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
On the Efficiency of Convex Polyhedra.
Proceedings of the Seventh Workshop on Numericaland Symbolic Abstract Domains, 2017

A Conversion Procedure for NNC Polyhedra.
CoRR, 2017

2014
Efficient Constraint/Generator Removal from Double Description of Polyhedra.
Proceedings of the Fifth International Workshop on Numerical and Symbolic Abstract Domains, 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 Syst. Des., 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.
Int. J. Softw. Tools Technol. Transf., 2007

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

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

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.
Theory Pract. Log. Program., 2005

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

Not necessarily closed convex polyhedra and the double description method.
Formal Aspects 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.
Theory Pract. Log. Program., 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

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

2002
Decomposing non-redundant sharing by complementation.
Theory Pract. Log. Program., 2002

Soundness, idempotence and commutativity of set-sharing.
Theory Pract. Log. Program., 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

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

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

1999
Widening Sharing.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

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

1998
The Correctness of Set-Sharing.
Proceedings of the 1998 Joint Conference on Declarative Programming, 1998

1997
Abstracting Synchronization in Concurrent Constraint Programming.
J. Funct. Log. Program., 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 1995 Joint Conference on Declarative Programming, 1995


  Loading...