Patricia M. Hill

99 papers A* 1A 4B 17C 10Journal 46Unranked 19

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