Roberto Bagnara

According to our database1, Roberto Bagnara authored at least 73 papers between 1992 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
That's C, baby. C!
CoRR, 2019

Correct Approximation of IEEE 754 Floating-Point Arithmetic for Program Verification.
CoRR, 2019

2018
The MISRA C Coding Standard and its Role in the Development and Analysis of Safety- and Security-Critical Embedded Software.
CoRR, 2018

The MISRA C Coding Standard and its Role in the Development and Analysis of Safety- and Security-Critical Embedded Software.
Proceedings of the Static Analysis - 25th International Symposium, 2018

2017
MISRA C, for Security's Sake!
CoRR, 2017

2016
Exploiting Binary Floating-Point Representations for Constraint Propagation.
INFORMS Journal on Computing, 2016

A Practical Approach to Interval Refinement for math.h/cmath Functions.
CoRR, 2016

The ACPATH Metric: Precise Estimation of the Number of Acyclic Paths in C-like Languages.
CoRR, 2016

2013
Proceedings of the 12th International Colloquium on Implementation of Constraint and LOgic Programming Systems
CoRR, 2013

Eventual Linear Ranking Functions.
CoRR, 2013

Filtering Floating-Point Constraints by Maximum ULP.
CoRR, 2013

Eventual linear ranking functions.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

Symbolic Path-Oriented Test Data Generation for Floating-Point Programs.
Proceedings of the Sixth IEEE International Conference on Software Testing, 2013

2012
Coding guidelines for Prolog.
TPLP, 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

Coding Guidelines for Prolog
CoRR, 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
cTI: A constraint-based termination inference tool for ISO-Prolog.
TPLP, 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
cTI: A constraint-based termination inference tool for ISO-Prolog
CoRR, 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
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
A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages.
Sci. Comput. Program., 1998

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

Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos.
Proceedings of the Algebraic Methodology and Software Technology, 1998

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

Structural Information Analysis for CLP Languages.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996
A Reactive Implementation of Pos Using ROBDDs.
Proceedings of the Programming Languages: Implementations, 1996

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

Straight ROBDDs are not the Best for Pos.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995
A Unified Proof for the Convergence of Jacobi and Gauss-Seidel Methods.
SIAM Review, 1995

Constraint Systems for Pattern Analysis of Constraint Logic-Based Languages.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995

1994
On the Detection of Implicit and Redundant Numeric Constraints in CLP Programs.
Proceedings of the ICLP 1994 Workshop W2: Verification and Analysis of (Concurrent) Logic Languages, 1994

On the Detection of Implicit and Redundant Numeric Constraint in CLP Programs.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

1992
Static Analysis of CLP Programs over Numeric Domains.
Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992


  Loading...