Patricia M. Hill

Publication Activity (10 Years)

Years Active: 1988-2022
Publications (10 Years): 6

Top Topics

Development Projects

Correct Classification

International Standards

Embedded Software

Top Venues

Publications

Roberto Bagnara, Abramo Bagnara, Patricia M. Hill
Coding Guidelines and Undecidability. CoRR (2022)
Roberto Bagnara, Abramo Bagnara, Patricia M. Hill
A Rationale-Based Classification of MISRA C Guidelines. CoRR (2021)
Roberto Bagnara, Michael Barr, Patricia M. Hill
BARR-C: 2018 and MISRA C: 2012: Synergy Between the Two Most Widely Used C Coding Standards. CoRR (2020)
Roberto Bagnara, Abramo Bagnara, Patricia M. Hill
The MISRA C Coding Standard and its Role in the Development and Analysis of Safety- and Security-Critical Embedded Software. SAS (2018)
Roberto Bagnara, Abramo Bagnara, Patricia M. Hill
The MISRA C Coding Standard and its Role in the Development and Analysis of Safety- and Security-Critical Embedded Software. CoRR (2018)
Roberto Bagnara, Abramo Bagnara, Alessandro Benedetti, Patricia M. Hill
The ACPATH Metric: Precise Estimation of the Number of Acyclic Paths in C-like Languages. CoRR (2016)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Exact join detection for convex polyhedra and other numerical abstractions. Comput. Geom. 43 (5) (2010)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Applications of polyhedral computations to the analysis and verification of hardware and software systems. Theor. Comput. Sci. 410 (46) (2009)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness. Formal Methods Syst. Des. 35 (3) (2009)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Exact Join Detection for Convex Polyhedra and Other Numerical Abstractions CoRR (2009)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72 (1-2) (2008)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
An Improved Tight Closure Algorithm for Integer Octagonal Constraints. VMCAI (2008)
Patricia M. Hill, Wim Vanhoof
Proceedings of the 17th Workshop on Logic-based methods in Programming Environments (WLPE 2007) CoRR (2007)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Widening operators for powerset domains. Int. J. Softw. Tools Technol. Transf. 9 (3-4) (2007)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems CoRR (2007)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
An Improved Tight Closure Algorithm for Integer Octagonal Constraints CoRR (2007)
Roberto Bagnara, Patricia M. Hill, Andrea Pescetti, Enea Zaffanella
On the Design of Generic Static Analyzers for Modern Imperative Languages CoRR (2007)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
A Prolog-based Environment for Reasoning about Programming Languages (Extended abstract) CoRR (2007)
Antonio J. Fernández, Patricia M. Hill
An Interval Constraint Branching Scheme for Lattice Domains. J. Univers. Comput. Sci. 12 (11) (2006)
Patricia M. Hill, Fausto Spoto
Deriving escape analysis by abstract interpretation. High. Order Symb. Comput. 19 (4) (2006)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Widening operators for powerset domains. Int. J. Softw. Tools Technol. Transf. 8 (4-5) (2006)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Verification of Hardware and Software Systems CoRR (2006)
Roberto Bagnara, Katy Louise Dobson, Patricia M. Hill, Matthew Mundell, Enea Zaffanella
Grids: A Domain for Analyzing the Distribution of Numerical Values. LOPSTR (2006)
Patricia M. Hill, Fausto Spoto
Deriving Escape Analysis by Abstract Interpretation: Proofs of results CoRR (2006)
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
Enhanced sharing analysis techniques: a comprehensive evaluation. Theory Pract. Log. Program. 5 (1-2) (2005)
Roberto Bagnara, Patricia M. Hill, Elisa Ricci, Enea Zaffanella
Precise widening operators for convex polyhedra. Sci. Comput. Program. 58 (1-2) (2005)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Not necessarily closed convex polyhedra and the double description method. Formal Aspects Comput. 17 (2) (2005)
Roberto Bagnara, Patricia M. Hill, Elena Mazzi, Enea Zaffanella
Widening Operators for Weakly-Relational Numeric Abstractions. SAS (2005)
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages CoRR (2004)
Roberto Bagnara, Patricia M. Hill, Elena Mazzi, Enea Zaffanella
Widening Operators for Weakly-Relational Numeric Abstractions (Extended Abstract) CoRR (2004)
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
Enhanced sharing analysis techniques: a comprehensive evaluation CoRR (2004)
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages. Theory Pract. Log. Program. 4 (3) (2004)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Widening Operators for Powerset Domains. VMCAI (2004)
Antonio J. Fernández, Patricia M. Hill
An interval constraint system for lattice domains. ACM Trans. Program. Lang. Syst. 26 (1) (2004)
Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version CoRR (2004)
Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella
Finite-tree analysis for constraint logic-based languages. Inf. Comput. 193 (2) (2004)
Roberto Bagnara, Patricia M. Hill, Elisa Ricci, Enea Zaffanella
Precise Widening Operators for Convex Polyhedra. SAS (2003)
Patricia M. Hill, Fausto Spoto
Logic Programs as Compact Denotations. PADL (2003)
Patricia M. Hill, Fausto Spoto
Logic programs as compact denotations. Comput. Lang. Syst. Struct. 29 (3) (2003)
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
Decomposing non-redundant sharing by complementation. Theory Pract. Log. Program. 2 (2) (2002)
Patricia M. Hill, Fausto Spoto
Generalizing Def and Pos to Type Analysis. J. Log. Comput. 12 (3) (2002)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Set-sharing is redundant for pair-sharing. Theor. Comput. Sci. 277 (1-2) (2002)
Patricia M. Hill, Fausto Spoto
A Refinement of the Escape Property. VMCAI (2002)
Patricia M. Hill, Fausto Spoto
A Foundation of Escape Analysis. AMAST (2002)
Roberto Bagnara, Elisa Ricci, Enea Zaffanella, Patricia M. Hill
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library. SAS (2002)
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
Soundness, idempotence and commutativity of set-sharing. Theory Pract. Log. Program. 2 (2) (2002)
Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella
Finite-tree analysis for constraint logic-based languages. APPIA-GULP-PRODE (2001)
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
Decomposing Non-Redundant Sharing by Complementation CoRR (2001)
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill
Boolean Functions for Finite-Tree Dependencies. LPAR (2001)
Antonio J. Fernández, Patricia M. Hill
Branching: the Essence of Constraint Solving CoRR (2001)
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill
Boolean functions for finite-tree dependencies. APPIA-GULP-PRODE (2001)
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
Soundness, Idempotence and Commutativity of Set-Sharing CoRR (2001)
Jan-Georg Smaus, Patricia M. Hill, Andy King
Declarations. Theory Pract. Log. Program. 1 (4) (2001)
Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella
Finite-Tree Analysis for Constraint Logic-Based Languages. SAS (2001)
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
Enhanced sharing analysis techniques: a comprehensive evaluation. PPDP (2000)
Jan-Georg Smaus, Patricia M. Hill, Andy King
Verifying Termination and Error-Freedom of Logic Programs with block Declarations CoRR (2000)
Antonio Brogi, Patricia M. Hill
Special Issue on Logical Formalisms for Program Composition - Editorial. J. Funct. Log. Program. 2000 (2) (2000)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Efficient Structural Information Analysis for Real CLP Languages. LPAR (2000)
Andrew Heaton, Patricia M. Hill, Andy King
Abstract Domains for Universal and Existential Properties. ESOP (2000)
Antonio J. Fernández, Patricia M. Hill
A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains. Constraints An Int. J. 5 (3) (2000)
Antonio J. Fernández, Patricia M. Hill
Constraint Propagation on Multiple Domains. WFLP (2000)
Patricia M. Hill, Fausto Spoto
Analysis of Downward Closed Properties of Logic Programs. AMAST (2000)
Antonio J. Fernández, Patricia M. Hill
Extending clp(FD) by Negative Constraint Solving. APPIA-GULP-PRODE (1999)
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
Decomposing Non-redundant Sharing by Complementation. SAS (1999)
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
Widening Sharing. PPDP (1999)
Antonio J. Fernández, Patricia M. Hill
Constraint Solving on Lattices. APPIA-GULP-PRODE (1999)
Patricia M. Hill, Fausto Spoto
Freeness Analysis through Linear Refinement. APPIA-GULP-PRODE (1999)
Antonio J. Fernández, Patricia M. Hill
An Interval Lattice-Based Constraint Solving Framework for Lattices. Fuji International Symposium on Functional and Logic Programming (1999)
Patricia M. Hill, Fausto Spoto
Freeness Analysis Through Linear Refinement. SAS (1999)
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
Enhancing Sharing for Precision. APPIA-GULP-PRODE (1999)
Jan-Georg Smaus, Patricia M. Hill, Andy King
Mode Analysis Domains for Typed Logic Programs. LOPSTR (1999)
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
Widening Sharing. APPIA-GULP-PRODE (1999)
Andy King, Jan-Georg Smaus, Patricia M. Hill
for Dependency Analysis. ESOP (1999)
Jan-Georg Smaus, Patricia M. Hill, Andy King
Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations. LOPSTR (1998)
Antonio J. Fernández, Patricia M. Hill
An Impartial Efficiency Comparison of FD Constraint Systems. CP (1998)
Jan-Georg Smaus, Patricia M. Hill, Andy King
Termination of Logic Programs with block Declarations Running in Several Modes. PLILP/ALP (1998)
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
The Correctness of Set-Sharing. SAS (1998)
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
The Correctness of Set-Sharing. APPIA-GULP-PRODE (1998)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Set-Sharing is Redundant for Pair-Sharing. SAS (1997)
Antony Francis Bowers, Patricia M. Hill, Francisco Ibañez
Resolution for Logic Programming with Universal Quantifiers. PLILP (1997)
Jan-Georg Smaus, Patricia M. Hill, Andy King
Domain Construction for Mode Analysis of Typed Logic Programs. ICLP (1997)
Andrew Heaton, Patricia M. Hill, Andy King
Analysis of Logic Programs with Delay. LOPSTR (1997)
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
Sharing Revisited. APPIA-GULP-PRODE (1997)
Antonio J. Fernández, Patricia M. Hill
Boolean and Finite Domain Solvers Compared Using Self Referential Quizzes. APPIA-GULP-PRODE (1997)
Patricia M. Hill, Andy King
Determinacy and determinacy analysis. J. Program. Lang. 5 (1) (1997)
Patricia M. Hill
A Module System for Meta-Programming. META (1994)
Patricia M. Hill
The Completion of Typed Logic Programs and SLDNF-Resolution. LPAR (1993)
Patricia M. Hill
A Parameterised Module System for Constructing Typed Logic Programs. IJCAI (1993)
Kerima Benkerimi, Patricia M. Hill
Supporting Transformations for the Partial Evaluation of Logic Programs. J. Log. Comput. 3 (5) (1993)
Antony Francis Bowers, Patricia M. Hill
An Introduction to Gödel. ALPUK (1992)
Patricia M. Hill
Data Structures and Typed Logic Programs. ECAI (1992)
Kerima Benkerimi, Patricia M. Hill
Object-Oriented Programming in Gödel: An Experiment. META (1992)
Patricia M. Hill, John W. Lloyd, John C. Shepherdson
Properties of a Pruning Operator. J. Log. Comput. 1 (1) (1990)
Patricia M. Hill, John W. Lloyd
Analysis of Meta-Programs. META (1988)