Selected Scientific Publications
Détection des fonctions de rang linéaires à terme. Neuvièmes Journées Francophones de Programmation par Contraintes (JFPC 2013).
AlezanBMP13JFPC.pdf (286.56 KB)
.
2013. 
Eventual Linear Ranking Functions. 15th International Symposium on Principles and Practice of Declarative Programming (PPDP 2013). :229-238.
BagnaraM13PPDP.pdf (276.55 KB)
.
2013. 
Symbolic Path-Oriented Test Data Generation for Floating-Point Programs. Proceedings of the 6th IEEE International Conference on Software Testing, Verification and Validation. :10.
BagnaraCGG13ICST.pdf (367.36 KB)
.
2013. 
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version.
BagnaraMPZ12TR.pdf (561.17 KB)
.
2012. 
Coding Guidelines for Prolog. Theory and Practice of Logic Programming. 12:889-927.
.
2012. A New Look at the Automatic Synthesis of Linear Ranking Functions. Information and Computation. 215:47-67.
BagnaraMPZ12IC.pdf (463.08 KB)
.
2012. 
Exact Join Detection for Convex Polyhedra and Other Numerical Abstractions. Computational Geometry: Theory and Applications. 43:453–473.
BagnaraHZ10CGTA.pdf (339.41 KB)
.
2010. 
Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems. Theoretical Computer Science. 410:4672–4691.
BagnaraHZ09TCS.pdf (391.35 KB)
.
2009. 
Weakly-Relational Shapes for Numeric Abstractions: Improved Algorithms and Proofs of Correctness. Formal Methods in System Design. 35:279–323.
BagnaraHZ09FMSD.pdf (437.68 KB)
.
2009. 
.
2008.
An Improved Tight Closure Algorithm for Integer Octagonal Constraints. Verification, Model Checking and Abstract Interpretation: Proceedings of the 9th International Conference (VMCAI 2008). 4905:8–21.
BagnaraHZ08.pdf (176.48 KB)
.
2008. 
The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Verification of Hardware and Software Systems. Science of Computer Programming. 72:3–21.
BagnaraHZ08SCP.pdf (298.58 KB)
.
2008. 
Grids: A Domain for Analyzing the Distribution of Numerical Values. Logic-based Program Synthesis and Transformation, 16th International Symposium. 4407:219–235.
BagnaraDHMZ07.pdf (222.94 KB)
.
2007. 
Verification of C Programs Via Natural Semantics and Abstract Interpretation. Proceedings of the C/C++ Verification Workshop. :75–80.
.
2007. Deriving Escape Analysis by Abstract Interpretation. Higher-Order and Symbolic Computation. 19:415–463.
.
2006. Widening Operators for Powerset Domains. Software Tools for Technology Transfer. 8:449–466.
BagnaraHZ06STTT.pdf (362.41 KB)
.
2006. 
cTI: A Constraint-Based Termination Inference Tool for ISO-Prolog. Theory and Practice of Logic Programming. 5:243–257.
MesnardB05TPLP.pdf (252.51 KB)
.
2005. 
Enhanced Sharing Analysis Techniques: A Comprehensive Evaluation. Theory and Practice of Logic Programming. 5:1-43.
BagnaraZH05TPLP.pdf (449.66 KB)
.
2005. 
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra. Static Analysis: Proceedings of the 12th International Symposium. 3672:19–34.
BagnaraR-CZ05.pdf (184.1 KB)
.
2005. 
Not Necessarily Closed Convex Polyhedra and the Double Description Method. Formal Aspects of Computing. 17:222–257.
BagnaraHZ05FAC.pdf (388.2 KB)
.
2005. 
Precise Widening Operators for Convex Polyhedra. Science of Computer Programming. 58:28–56.
BagnaraHRZ05SCP.pdf (273.43 KB)
.
2005. 
.
2004.
A Correct, Precise and Efficient Integration of Set-Sharing, Freeness and Linearity for the Analysis of Finite and Rational Tree Languages. Theory and Practice of Logic Programming. 4:289–323.
HillZB04TPLP.pdf (358.98 KB)
.
2004. 
Finite-Tree Analysis for Constraint Logic-Based Languages. Information and Computation. 193:84-116.
BagnaraGHZ04IC.pdf (301.52 KB)
.
2004. 
Decomposing Non-Redundant Sharing by Complementation. Theory and Practice of Logic Programming. 2:233–261.
ZaffanellaHB02TPLP.pdf (237.44 KB)
.
2002. .
2002. 
A Foundation of Escape Analysis. Algebraic Methodology and Software Technology; Proceedings of 9th International Conference, AMAST 2002. 2422:380–395.
.
2002. Set-Sharing is Redundant for Pair-Sharing. Theoretical Computer Science. 277:3–46.
BagnaraHZ02TCS.pdf (413.66 KB)
.
2002. 
Soundness, Idempotence and Commutativity of Set-Sharing. Theory and Practice of Logic Programming. 2:155–201.
HillBZ02TPLP.pdf (406.08 KB)
.
2002. 
Boolean Functions for Finite-Tree Dependencies. Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2001). 2250:579–594.
.
2001. Finite-Tree Analysis for Constraint Logic-Based Languages. Static Analysis: 8th International Symposium, SAS 2001. 2126:165–184.
.
2001. Analysis of Downward Closed Properties of Logic Programs. Proceedings of the International Conference on Algebraic Methodology and Software Technology. 1816:181–196.
.
2000. Efficient Structural Information Analysis for Real CLP Languages. Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR 2000). 1955:189–206.
.
2000. Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos. Proceedings of the ‘‘Seventh International Conference on Algebraic Methodology and Software Technology (AMAST’98)’’. 1548:471–485.
.
1999. Freeness Analysis through Linear Refinement. Static Analysis: Proceedings of the 6th International Symposium. :85–100.
.
1999. Quotienting Share for Dependency Analysis. Proceedings of the European Symposium on Programming. 1576:59–73.
.
1999. Widening Sharing. Principles and Practice of Declarative Programming. 1702:414–431.
.
1999. The Correctness of Set-Sharing. Static Analysis: Proceedings of the 5th International Symposium. 1503:99–114.
.
1998. A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages. Science of Computer Programming. 30:119–155.
Bagnara98SCP.pdf (369.58 KB)
.
1998. 
Abstracting Synchronization in Concurrent Constraint Programming. Journal of Functional and Logic Programming. 1997:1–34.
ZaffanellaGL97JFLP.pdf (329.28 KB)
.
1997. 
Determinacy and Determinacy Analysis. Journal of Programming Languages. 5:135–171.
.
1997. Set-Sharing is Redundant for Pair-Sharing. Static Analysis: Proceedings of the 4th International Symposium. 1302:53–67.
.
1997. A Reactive Implementation of Pos Using ROBDDs. Programming Languages: Implementations, Logics and Programs, Proceedings of the Eighth International Symposium. 1140:107–121.
.
1996. .
1994.
An Application of Constraint Propagation to Data-Flow Analysis. Proceedings of ‘‘The Ninth Conference on Artificial Intelligence for Applications’’. :270–276.
.
1993. Static Analysis of CLP Programs over Numeric Domains. Actes ‘‘Workshop on Static Analysis ’92’’. 81–82:43–50.
.
1992.