Analysis of Meta-Programs. - Patricia M. Hill; John W. Lloyd (META, 1988)

Properties of a Pruning Operator. - Patricia M. Hill; John W. Lloyd; John C. Shepherdson (J. Log. Comput., 1990)

A Semantics for Typed Logic Programs. - Patricia M. Hill; Rodney W. Topor (Types in Logic Programming, 1992)

An Introduction to Gödel. - Antony Francis Bowers; Patricia M. Hill (ALPUK, 1992)

Data Structures and Typed Logic Programs. - Patricia M. Hill (ECAI, 1992)

Object-Oriented Programming in Gödel: An Experiment. - Kerima Benkerimi; Patricia M. Hill (META, 1992)

A Parameterised Module System for Constructing Typed Logic Programs. - Patricia M. Hill (IJCAI, 1993)

The Completion of Typed Logic Programs and SLDNF-Resolution. - Patricia M. Hill (LPAR, 1993)

Supporting Transformations for the Partial Evaluation of Logic Programs. - Kerima Benkerimi; Patricia M. Hill (J. Log. Comput., 1993)

The Gödel programming language. - Patricia M. Hill; John W. Lloyd (MIT Press, 1994)

A Module System for Meta-Programming. - Patricia M. Hill (META, 1994)

Sharing Revisited. - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (APPIA-GULP-PRODE, 1997)

Boolean and Finite Domain Solvers Compared Using Self Referential Quizzes. - Antonio J. Fernández 001; Patricia M. Hill (APPIA-GULP-PRODE, 1997)

Domain Construction for Mode Analysis of Typed Logic Programs. - Jan-Georg Smaus; Patricia M. Hill; Andy King (ICLP, 1997)

Analysis of Logic Programs with Delay. - Andrew Heaton; Patricia M. Hill; Andy King (LOPSTR, 1997)

Resolution for Logic Programming with Universal Quantifiers. - Antony Francis Bowers; Patricia M. Hill; Francisco Ibañez (PLILP, 1997)

Determinacy and determinacy analysis. - Patricia M. Hill; Andy King (J. Program. Lang., 1997)

The Correctness of Set-Sharing. - Patricia M. Hill; Roberto Bagnara; Enea Zaffanella (APPIA-GULP-PRODE, 1998)

An Impartial Efficiency Comparison of FD Constraint Systems. - Antonio J. Fernández 001; Patricia M. Hill (CP, 1998)

Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations. - Jan-Georg Smaus; Patricia M. Hill; Andy King (LOPSTR, 1998)

Termination of Logic Programs with block Declarations Running in Several Modes. - Jan-Georg Smaus; Patricia M. Hill; Andy King (PLILP/ALP, 1998)

Enhancing Sharing for Precision. - Roberto Bagnara; Enea Zaffanella; Patricia M. Hill (APPIA-GULP-PRODE, 1999)

Constraint Solving on Lattices. - Antonio J. Fernández 001; Patricia M. Hill (APPIA-GULP-PRODE, 1999)

Extending clp(FD) by Negative Constraint Solving. - Antonio J. Fernández 001; Patricia M. Hill (APPIA-GULP-PRODE, 1999)

Freeness Analysis through Linear Refinement. - Patricia M. Hill; Fausto Spoto (APPIA-GULP-PRODE, 1999)

Widening Sharing. - Enea Zaffanella; Roberto Bagnara; Patricia M. Hill (APPIA-GULP-PRODE, 1999)

Quotienting Share for Dependency Analysis. - Andy King; Jan-Georg Smaus; Patricia M. Hill (ESOP, 1999)

An Interval Lattice-Based Constraint Solving Framework for Lattices. - Antonio J. Fernández 001; Patricia M. Hill (Fuji International Symposium on Functional and Logic Programming, 1999)

Mode Analysis Domains for Typed Logic Programs. - Jan-Georg Smaus; Patricia M. Hill; Andy King (LOPSTR, 1999)

Analysis of Downward Closed Properties of Logic Programs. - Patricia M. Hill; Fausto Spoto (AMAST, 2000)

Abstract Domains for Universal and Existential Properties. - Andrew Heaton; Patricia M. Hill; Andy King (ESOP, 2000)

Efficient Structural Information Analysis for Real CLP Languages. - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (LPAR, 2000)

Constraint Propagation on Multiple Domains. - Antonio J. Fernández 001; Patricia M. Hill (WFLP, 2000)

A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains. - Antonio J. Fernández 001; Patricia M. Hill (Constraints An Int. J., 2000)

Verifying Termination and Error-Freedom of Logic Programs with block Declarations - Jan-Georg Smaus; Patricia M. Hill; Andy King (CoRR, 2000)

Special Issue on Logical Formalisms for Program Composition - Editorial. - Antonio Brogi; Patricia M. Hill (J. Funct. Log. Program., 2000)

Boolean functions for finite-tree dependencies. - Roberto Bagnara; Enea Zaffanella; Roberta Gori; Patricia M. Hill (APPIA-GULP-PRODE, 2001)

Branching: the Essence of Constraint Solving - Antonio J. Fernández 001; Patricia M. Hill (CoRR, 2001)

Verifying Termination and Error-Freedom of Logic Programs with block Declarations. - Jan-Georg Smaus; Patricia M. Hill; Andy King (Theory Pract. Log. Program., 2001)

A Foundation of Escape Analysis. - Patricia M. Hill; Fausto Spoto (AMAST, 2002)

Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library. - Roberto Bagnara; Elisa Ricci 002; Enea Zaffanella; Patricia M. Hill (SAS, 2002)

A Refinement of the Escape Property. - Patricia M. Hill; Fausto Spoto (VMCAI, 2002)

Generalizing Def and Pos to Type Analysis. - Patricia M. Hill; Fausto Spoto (J. Log. Comput., 2002)

Set-sharing is redundant for pair-sharing. - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (Theor. Comput. Sci., 2002)

Soundness, idempotence and commutativity of set-sharing. - Patricia M. Hill; Roberto Bagnara; Enea Zaffanella (Theory Pract. Log. Program., 2002)

Decomposing non-redundant sharing by complementation. - Enea Zaffanella; Patricia M. Hill; Roberto Bagnara (Theory Pract. Log. Program., 2002)

Logic programs as compact denotations. - Patricia M. Hill; Fausto Spoto (Comput. Lang. Syst. Struct., 2003)

Widening Operators for Weakly-Relational Numeric Abstractions (Extended Abstract) - Roberto Bagnara; Patricia M. Hill; Elena Mazzi; Enea Zaffanella (CoRR, 2004)

Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version - Roberto Bagnara; Roberta Gori; Patricia M. Hill; Enea Zaffanella (CoRR, 2004)

Finite-tree analysis for constraint logic-based languages. - Roberto Bagnara; Roberta Gori; Patricia M. Hill; Enea Zaffanella (Inf. Comput., 2004)

An interval constraint system for lattice domains. - Antonio J. Fernández 001; Patricia M. Hill (ACM Trans. Program. Lang. Syst., 2004)

A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages. - Patricia M. Hill; Enea Zaffanella; Roberto Bagnara (Theory Pract. Log. Program., 2004)

Widening Operators for Weakly-Relational Numeric Abstractions. - Roberto Bagnara; Patricia M. Hill; Elena Mazzi; Enea Zaffanella (SAS, 2005)

Not necessarily closed convex polyhedra and the double description method. - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (Formal Aspects Comput., 2005)

Precise widening operators for convex polyhedra. - Roberto Bagnara; Patricia M. Hill; Elisa Ricci 002; Enea Zaffanella (Sci. Comput. Program., 2005)

Enhanced sharing analysis techniques: a comprehensive evaluation. - Roberto Bagnara; Enea Zaffanella; Patricia M. Hill (Theory Pract. Log. Program., 2005)

Grids: A Domain for Analyzing the Distribution of Numerical Values. - Roberto Bagnara; Katy Louise Dobson; Patricia M. Hill; Matthew Mundell; Enea Zaffanella (LOPSTR, 2006)

Deriving Escape Analysis by Abstract Interpretation: Proofs of results - Patricia M. Hill; Fausto Spoto (CoRR, 2006)

An Interval Constraint Branching Scheme for Lattice Domains. - Antonio J. Fernández 001; Patricia M. Hill (J. Univers. Comput. Sci., 2006)

Deriving escape analysis by abstract interpretation. - Patricia M. Hill; Fausto Spoto (High. Order Symb. Comput., 2006)

A Prolog-based Environment for Reasoning about Programming Languages (Extended abstract) - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (CoRR, 2007)

Proceedings of the 17th Workshop on Logic-based methods in Programming Environments (WLPE 2007) - Patricia M. Hill; Wim Vanhoof (CoRR, 2007)

On the Design of Generic Static Analyzers for Modern Imperative Languages - Roberto Bagnara; Patricia M. Hill; Andrea Pescetti; Enea Zaffanella (CoRR, 2007)

Widening operators for powerset domains. - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (Int. J. Softw. Tools Technol. Transf., 2007)

An Improved Tight Closure Algorithm for Integer Octagonal Constraints. - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (VMCAI, 2008)

The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (Sci. Comput. Program., 2008)

Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness. - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (Formal Methods Syst. Des., 2009)

Applications of polyhedral computations to the analysis and verification of hardware and software systems. - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (Theor. Comput. Sci., 2009)

Exact join detection for convex polyhedra and other numerical abstractions. - Roberto Bagnara; Patricia M. Hill; Enea Zaffanella (Comput. Geom., 2010)

The ACPATH Metric: Precise Estimation of the Number of Acyclic Paths in C-like Languages. - Roberto Bagnara; Abramo Bagnara; Alessandro Benedetti; Patricia M. Hill (CoRR, 2016)

The MISRA C Coding Standard and its Role in the Development and Analysis of Safety- and Security-Critical Embedded Software. - Roberto Bagnara; Abramo Bagnara; Patricia M. Hill (SAS, 2018)

BARR-C: 2018 and MISRA C: 2012: Synergy Between the Two Most Widely Used C Coding Standards. - Roberto Bagnara; Michael Barr; Patricia M. Hill (CoRR, 2020)

A Rationale-Based Classification of MISRA C Guidelines. - Roberto Bagnara; Abramo Bagnara; Patricia M. Hill (CoRR, 2021)

Coding Guidelines and Undecidability. - Roberto Bagnara; Abramo Bagnara; Patricia M. Hill (CoRR, 2022)

The ACPATH Structural Complexity Metric. - Roberto Bagnara; Abramo Bagnara; Alessandro Benedetti; Patricia M. Hill (QRS, 2024)