Selected Scientific Publications
Export 26 results:Author Title Type [ Year]
Filters: Keyword is software verification and Author is Patricia M. Hill [Clear All Filters]
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.
The Correctness of Set-Sharing. Static Analysis: Proceedings of the 5th International Symposium. 1503:99–114.. 1998.
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.
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.
Finite-Tree Analysis for Constraint Logic-Based Languages. Static Analysis: 8th International Symposium, SAS 2001. 2126:165–184.. 2001.
Decomposing Non-Redundant Sharing by Complementation. Theory and Practice of Logic Programming. 2:233–261.. 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.. 2002.
Soundness, Idempotence and Commutativity of Set-Sharing. Theory and Practice of Logic Programming. 2:155–201.. 2002.
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.
Finite-Tree Analysis for Constraint Logic-Based Languages. Information and Computation. 193:84-116.. 2004.
Enhanced Sharing Analysis Techniques: A Comprehensive Evaluation. Theory and Practice of Logic Programming. 5:1-43.. 2005.
Not Necessarily Closed Convex Polyhedra and the Double Description Method. Formal Aspects of Computing. 17:222–257.. 2005.
Precise Widening Operators for Convex Polyhedra. Science of Computer Programming. 58:28–56.. 2005.
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.. 2006.
Grids: A Domain for Analyzing the Distribution of Numerical Values. Logic-based Program Synthesis and Transformation, 16th International Symposium. 4407:219–235.. 2007.
Verification of C Programs Via Natural Semantics and Abstract Interpretation. Proceedings of the C/C++ Verification Workshop. :75–80.. 2007.
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.
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.
Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems. Theoretical Computer Science. 410:4672–4691.. 2009.
Weakly-Relational Shapes for Numeric Abstractions: Improved Algorithms and Proofs of Correctness. Formal Methods in System Design. 35:279–323.. 2009.