Selected Scientific Publications

Export 36 results:
Sort by: Author Title Type [ Year (Desc)]
In Press
Alezan A, Bagnara R, Mesnard F, Payet É.  In Press.  Détection des fonctions de rang linéaires à terme. Neuvièmes Journées Francophones de Programmation par Contraintes (JFPC 2013). Abstract
2009
Bagnara R, Hill PM, Zaffanella E.  2009.  Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems. Theoretical Computer Science. 410(46):4672–4691. Abstract  Download: BagnaraHZ09TCS.pdf (391.35 KB)
Bagnara R, Hill PM, Zaffanella E.  2009.  Weakly-Relational Shapes for Numeric Abstractions: Improved Algorithms and Proofs of Correctness. Formal Methods in System Design. 35(3):279–323. Abstract  Download: BagnaraHZ09FMSD.pdf (437.68 KB)
2008
Bagnara R, Hill PM, Zaffanella E.  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. Abstract  Download: BagnaraHZ08.pdf (176.48 KB)
Bagnara R, Hill PM, Pescetti A, Zaffanella E.  2008.  On the Design of Generic Static Analyzers for Imperative Languages. Abstract  Download: BagnaraHPZ08.pdf (632.79 KB)
Bagnara R, Hill PM, Zaffanella E.  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(1-2):3–21. Abstract  Download: BagnaraHZ08SCP.pdf (298.58 KB)
2007
Bagnara R, Dobson K, Hill PM, Mundell M, Zaffanella E.  2007.  Grids: A Domain for Analyzing the Distribution of Numerical Values. Logic-based Program Synthesis and Transformation, 16th International Symposium. 4407:219–235. Abstract  Download: BagnaraDHMZ07.pdf (222.94 KB)
Bagnara R, Hill PM, Pescetti A, Zaffanella E.  2007.  Verification of C Programs Via Natural Semantics and Abstract Interpretation. Proceedings of the C/C++ Verification Workshop. :75–80.
2006
Hill PM, Spoto F.  2006.  Deriving Escape Analysis by Abstract Interpretation. Higher-Order and Symbolic Computation. 19(4):415–463. Abstract
Bagnara R, Hill PM, Zaffanella E.  2006.  Widening Operators for Powerset Domains. Software Tools for Technology Transfer. 8(4/5):449–466. Abstract  Download: BagnaraHZ06STTT.pdf (362.41 KB)
2005
Mesnard F, Bagnara R.  2005.  cTI: A Constraint-Based Termination Inference Tool for ISO-Prolog. Theory and Practice of Logic Programming. 5(1&2):243–257. Abstract  Download: MesnardB05TPLP.pdf (252.51 KB)
Bagnara R, Zaffanella E, Hill PM.  2005.  Enhanced Sharing Analysis Techniques: A Comprehensive Evaluation. Theory and Practice of Logic Programming. 5(1&2):1-43. Abstract  Download: BagnaraZH05TPLP.pdf (449.66 KB)
Bagnara R, Rodríguez-Carbonell E, Zaffanella E.  2005.  Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra. Static Analysis: Proceedings of the 12th International Symposium. 3672:19–34. Abstract  Download: BagnaraR-CZ05.pdf (184.1 KB)
Bagnara R, Hill PM, Zaffanella E.  2005.  Not Necessarily Closed Convex Polyhedra and the Double Description Method. Formal Aspects of Computing. 17(2):222–257. Abstract  Download: BagnaraHZ05FAC.pdf (388.2 KB)
Bagnara R, Hill PM, Ricci E, Zaffanella E.  2005.  Precise Widening Operators for Convex Polyhedra. Science of Computer Programming. 58(1-2):28–56. Abstract  Download: BagnaraHRZ05SCP.pdf (273.43 KB)
2004
Hill PM, Zaffanella E, Bagnara R.  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(3):289–323. Abstract  Download: HillZB04TPLP.pdf (358.98 KB)
Bagnara R, Gori R, Hill PM, Zaffanella E.  2004.  Finite-Tree Analysis for Constraint Logic-Based Languages. Information and Computation. 193(2):84-116. Abstract  Download: BagnaraGHZ04IC.pdf (301.52 KB)
2003
Bagnara R, Zaccagnini A, Zolo T.  2003.  The Automatic Solution of Recurrence Relations. I. Linear Recurrences of Finite Order with Constant Coefficients. Abstract
2002
Zaffanella E, Hill PM, Bagnara R.  2002.  Decomposing Non-Redundant Sharing by Complementation. Theory and Practice of Logic Programming. 2(2):233–261. Abstract  Download: ZaffanellaHB02TPLP.pdf (237.44 KB)
Hill PM, Spoto F.  2002.  A Foundation of Escape Analysis. Algebraic Methodology and Software Technology; Proceedings of 9th International Conference, AMAST 2002. 2422:380–395. Abstract
Bagnara R, Hill PM, Zaffanella E.  2002.  Set-Sharing is Redundant for Pair-Sharing. Theoretical Computer Science. 277(1-2):3–46. Abstract  Download: BagnaraHZ02TCS.pdf (413.66 KB)
Hill PM, Bagnara R, Zaffanella E.  2002.  Soundness, Idempotence and Commutativity of Set-Sharing. Theory and Practice of Logic Programming. 2(2):155–201. Abstract  Download: HillBZ02TPLP.pdf (406.08 KB)
2001
Bagnara R, Gori R, Hill PM, Zaffanella E.  2001.  Finite-Tree Analysis for Constraint Logic-Based Languages. Static Analysis: 8th International Symposium, SAS 2001. 2126:165–184.
2000
Bagnara R, Hill PM, Zaffanella E.  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.
1999
Bagnara R, Schachte P.  1999.  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.
Hill PM, Spoto F.  1999.  Freeness Analysis through Linear Refinement. Static Analysis: Proceedings of the 6th International Symposium. :85–100. Abstract
King A, Smaus J-G, Hill PM.  1999.  Quotienting Share for Dependency Analysis. Proceedings of the European Symposium on Programming. 1576:59–73. Abstract
Zaffanella E, Bagnara R, Hill PM.  1999.  Widening Sharing. Principles and Practice of Declarative Programming. 1702:414–431.
1998
Hill PM, Bagnara R, Zaffanella E.  1998.  The Correctness of Set-Sharing. Static Analysis: Proceedings of the 5th International Symposium. 1503:99–114.
Bagnara R.  1998.  A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages. Science of Computer Programming. 30:119–155. Abstract  Download: Bagnara98SCP.pdf (369.58 KB)
1997
Zaffanella E, Giacobazzi R, Levi G.  1997.  Abstracting Synchronization in Concurrent Constraint Programming. Journal of Functional and Logic Programming. 1997:1–34. Abstract  Download: ZaffanellaGL97JFLP.pdf (329.28 KB)
Hill PM, King A.  1997.  Determinacy and Determinacy Analysis. Journal of Programming Languages. 5(1):135–171. Abstract
Bagnara R, Hill PM, Zaffanella E.  1997.  Set-Sharing is Redundant for Pair-Sharing. Static Analysis: Proceedings of the 4th International Symposium. 1302:53–67.
1996
Bagnara R.  1996.  A Reactive Implementation of Pos Using ROBDDs. Programming Languages: Implementations, Logics and Programs, Proceedings of the Eighth International Symposium. 1140:107–121.
1993
Bagnara R, Giacobazzi R, Levi G.  1993.  An Application of Constraint Propagation to Data-Flow Analysis. Proceedings of ``The Ninth Conference on Artificial Intelligence for Applications''. :270–276.
1992
Bagnara R, Giacobazzi R, Levi G.  1992.  Static Analysis of CLP Programs over Numeric Domains. Actes ``Workshop on Static Analysis '92''. 81–82:43–50.