Selected Scientific Publications
Export 37 results:[ Author] Title Type Year
Filters: Keyword is software verification [Clear All Filters]
Détection des fonctions de rang linéaires à terme. Neuvièmes Journées Francophones de Programmation par Contraintes (JFPC 2013).. 2013.
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.
Set-Sharing is Redundant for Pair-Sharing. Static Analysis: Proceedings of the 4th International Symposium. 1302:53–67.. 1997.
Eventual Linear Ranking Functions. 15th International Symposium on Principles and Practice of Declarative Programming (PPDP 2013). :229-238.. 2013.
Widening Operators for Powerset Domains. Software Tools for Technology Transfer. 8:449–466.. 2006.
Not Necessarily Closed Convex Polyhedra and the Double Description Method. Formal Aspects of Computing. 17:222–257.. 2005.
Finite-Tree Analysis for Constraint Logic-Based Languages. Static Analysis: 8th International Symposium, SAS 2001. 2126:165–184.. 2001.
The Automatic Solution of Recurrence Relations. I. Linear Recurrences of Finite Order with Constant Coefficients.. 2003.
Static Analysis of CLP Programs over Numeric Domains. Actes ‘‘Workshop on Static Analysis ’92’’. 81–82:43–50.. 1992.
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.. 2008.
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra. Static Analysis: Proceedings of the 12th International Symposium. 3672:19–34.. 2005.
Verification of C Programs Via Natural Semantics and Abstract Interpretation. Proceedings of the C/C++ Verification Workshop. :75–80.. 2007.
Finite-Tree Analysis for Constraint Logic-Based Languages. Information and Computation. 193:84-116.. 2004.
An Application of Constraint Propagation to Data-Flow Analysis. Proceedings of ‘‘The Ninth Conference on Artificial Intelligence for Applications’’. :270–276.. 1993.
Weakly-Relational Shapes for Numeric Abstractions: Improved Algorithms and Proofs of Correctness. Formal Methods in System Design. 35:279–323.. 2009.
Enhanced Sharing Analysis Techniques: A Comprehensive Evaluation. Theory and Practice of Logic Programming. 5:1-43.. 2005.
Set-Sharing is Redundant for Pair-Sharing. Theoretical Computer Science. 277:3–46.. 2002.
A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages. Science of Computer Programming. 30:119–155.. 1998.
Grids: A Domain for Analyzing the Distribution of Numerical Values. Logic-based Program Synthesis and Transformation, 16th International Symposium. 4407:219–235.. 2007.
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.
A Reactive Implementation of Pos Using ROBDDs. Programming Languages: Implementations, Logics and Programs, Proceedings of the Eighth International Symposium. 1140:107–121.. 1996.
Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems. Theoretical Computer Science. 410:4672–4691.. 2009.
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.. 2008.
Precise Widening Operators for Convex Polyhedra. Science of Computer Programming. 58:28–56.. 2005.
Determinacy and Determinacy Analysis. Journal of Programming Languages. 5:135–171.. 1997.
Deriving Escape Analysis by Abstract Interpretation. Higher-Order and Symbolic Computation. 19:415–463.. 2006.
Soundness, Idempotence and Commutativity of Set-Sharing. Theory and Practice of Logic Programming. 2:155–201.. 2002.
Freeness Analysis through Linear Refinement. Static Analysis: Proceedings of the 6th International Symposium. :85–100.. 1999.
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.. 2004.
A Foundation of Escape Analysis. Algebraic Methodology and Software Technology; Proceedings of 9th International Conference, AMAST 2002. 2422:380–395.. 2002.
The Correctness of Set-Sharing. Static Analysis: Proceedings of the 5th International Symposium. 1503:99–114.. 1998.
Quotienting Share for Dependency Analysis. Proceedings of the European Symposium on Programming. 1576:59–73.. 1999.
cTI: A Constraint-Based Termination Inference Tool for ISO-Prolog. Theory and Practice of Logic Programming. 5:243–257.. 2005.
Decomposing Non-Redundant Sharing by Complementation. Theory and Practice of Logic Programming. 2:233–261.. 2002.
Widening Sharing. Principles and Practice of Declarative Programming. 1702:414–431.. 1999.
Abstracting Synchronization in Concurrent Constraint Programming. Journal of Functional and Logic Programming. 1997:1–34.. 1997.