Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Patricia M. Hill
2010 – today
- 2010
[j25]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Exact join detection for convex polyhedra and other numerical abstractions. Comput. Geom. 43(5): 453-473 (2010)
2000 – 2009
- 2009
- [j24]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness. Formal Methods in System Design 35(3): 279-323 (2009)
- [j23]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): 4672-4691 (2009)
- [e2]Patricia M. Hill, David Scott Warren (Eds.): Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009. Proceedings. Lecture Notes in Computer Science 5649, Springer 2009, ISBN 978-3-642-02845-8
- [i16]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Exact Join Detection for Convex Polyhedra and Other Numerical Abstractions. CoRR abs/0904.1783 (2009)
- 2008
- [j22]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): 3-21 (2008)
- [c45]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: An Improved Tight Closure Algorithm for Integer Octagonal Constraints. VMCAI 2008: 8-21
- 2007
- [j21]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Widening operators for powerset domains. STTT 9(3-4): 413-414 (2007)
- [i15]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: An Improved Tight Closure Algorithm for Integer Octagonal Constraints. CoRR abs/0705.4618 (2007)
- [i14]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: A Prolog-based Environment for Reasoning about Programming Languages (Extended abstract). CoRR abs/0711.0345 (2007)
- [i13]Patricia M. Hill, Wim Vanhoof: Proceedings of the 17th Workshop on Logic-based methods in Programming Environments (WLPE 2007). CoRR abs/0712.3116 (2007)
- [i12]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems. CoRR abs/cs/0701122 (2007)
- [i11]Roberto Bagnara, Patricia M. Hill, Andrea Pescetti, Enea Zaffanella: On the Design of Generic Static Analyzers for Modern Imperative Languages. CoRR abs/cs/0703116 (2007)
- 2006
- [j20]Antonio J. Fernández, Patricia M. Hill: An Interval Constraint Branching Scheme for Lattice Domains. J. UCS 12(11): 1466-1499 (2006)
- [j19]Patricia M. Hill, Fausto Spoto: Deriving escape analysis by abstract interpretation. Higher-Order and Symbolic Computation 19(4): 415-463 (2006)
- [j18]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Widening operators for powerset domains. STTT 8(4-5): 449-466 (2006)
- [c44]Roberto Bagnara, Katy Dobson, Patricia M. Hill, Matthew Mundell, Enea Zaffanella: Grids: A Domain for Analyzing the Distribution of Numerical Values. LOPSTR 2006: 219-235
- [e1]Patricia M. Hill (Ed.): Logic Based Program Synthesis and Transformation, 15th International Symposium, LOPSTR 2005, London, UK, September 7-9, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3901, Springer 2006, ISBN 3-540-32654-5
- [i10]Patricia M. Hill, Fausto Spoto: Deriving Escape Analysis by Abstract Interpretation: Proofs of results. CoRR abs/cs/0607101 (2006)
- [i9]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 abs/cs/0612085 (2006)
- 2005
- [j17]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Not necessarily closed convex polyhedra and the double description method. Formal Asp. Comput. 17(2): 222-257 (2005)
- [j16]Roberto Bagnara, Patricia M. Hill, Elisa Ricci, Enea Zaffanella: Precise widening operators for convex polyhedra. Sci. Comput. Program. 58(1-2): 28-56 (2005)
- [j15]Roberto Bagnara, Enea Zaffanella, Patricia M. Hill: Enhanced sharing analysis techniques: a comprehensive evaluation. TPLP 5(1-2): 1-43 (2005)
- [c43]Roberto Bagnara, Patricia M. Hill, Elena Mazzi, Enea Zaffanella: Widening Operators for Weakly-Relational Numeric Abstractions. SAS 2005: 3-18
- 2004
- [j14]Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella: Finite-tree analysis for constraint logic-based languages. Inf. Comput. 193(2): 84-116 (2004)
- [j13]Antonio J. Fernández, Patricia M. Hill: An interval constraint system for lattice domains. ACM Trans. Program. Lang. Syst. 26(1): 1-46 (2004)
- [j12]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. TPLP 4(3): 289-323 (2004)
- [c42]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Widening Operators for Powerset Domains. VMCAI 2004: 135-148
- [i8]Roberto Bagnara, Patricia M. Hill, Elena Mazzi, Enea Zaffanella: Widening Operators for Weakly-Relational Numeric Abstractions (Extended Abstract). CoRR abs/cs/0412043 (2004)
- [i7]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 cs.PL/0401021 (2004)
- [i6]Roberto Bagnara, Enea Zaffanella, Patricia M. Hill: Enhanced sharing analysis techniques: a comprehensive evaluation. CoRR cs.PL/0401022 (2004)
- [i5]Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella: Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version. CoRR cs.PL/0404055 (2004)
- 2003
- [j11]Patricia M. Hill, Fausto Spoto: Logic programs as compact denotations. Computer Languages, Systems & Structures 29(3): 45-73 (2003)
- [c41]
- [c40]Roberto Bagnara, Patricia M. Hill, Elisa Ricci, Enea Zaffanella: Precise Widening Operators for Convex Polyhedra. SAS 2003: 337-354
- 2002
- [j10]Patricia M. Hill, Fausto Spoto: Generalizing Def and Pos to Type Analysis. J. Log. Comput. 12(3): 497-542 (2002)
- [j9]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Set-sharing is redundant for pair-sharing. Theor. Comput. Sci. 277(1-2): 3-46 (2002)
- [j8]Patricia M. Hill, Roberto Bagnara, Enea Zaffanella: Soundness, idempotence and commutativity of set-sharing. TPLP 2(2): 155-201 (2002)
- [j7]Enea Zaffanella, Patricia M. Hill, Roberto Bagnara: Decomposing non-redundant sharing by complementation. TPLP 2(2): 233-261 (2002)
- [c39]
- [c38]Roberto Bagnara, Elisa Ricci, Enea Zaffanella, Patricia M. Hill: Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library. SAS 2002: 213-229
- [c37]
- 2001
- [j6]Jan-Georg Smaus, Patricia M. Hill, Andy King: Verifying Termination and Error-Freedom of Logic Programs with block Declarations. TPLP 1(4): 447-486 (2001)
- [c36]Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill: Boolean Functions for Finite-Tree Dependencies. LPAR 2001: 579-594
- [c35]Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella: Finite-Tree Analysis for Constraint Logic-Based Languages. SAS 2001: 165-184
- [i4]Enea Zaffanella, Patricia M. Hill, Roberto Bagnara: Decomposing Non-Redundant Sharing by Complementation. CoRR cs.PL/0101025 (2001)
- [i3]Patricia M. Hill, Roberto Bagnara, Enea Zaffanella: Soundness, Idempotence and Commutativity of Set-Sharing. CoRR cs.PL/0102030 (2001)
- [i2]Antonio J. Fernández, Patricia M. Hill: Branching: the Essence of Constraint Solving. CoRR cs.PL/0109060 (2001)
- 2000
- [j5]Antonio J. Fernández, Patricia M. Hill: A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains. Constraints 5(3): 275-301 (2000)
- [j4]Antonio Brogi, Patricia M. Hill: Special Issue on Logical Formalisms for Program Composition - Editorial. Journal of Functional and Logic Programming 2000(2) (2000)
- [c34]Patricia M. Hill, Fausto Spoto: Analysis of Downward Closed Properties of Logic Programs. AMAST 2000: 181-196
- [c33]Andrew Heaton, Patricia M. Hill, Andy King: Abstract Domains for Universal and Existential Properties. ESOP 2000: 150-164
- [c32]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Efficient Structural Information Analysis for Real CLP Languages. LPAR 2000: 189-206
- [c31]Roberto Bagnara, Enea Zaffanella, Patricia M. Hill: Enhanced sharing analysis techniques: a comprehensive evaluation. PPDP 2000: 103-114
- [c30]Antonio J. Fernández, Patricia M. Hill: Constraint Propagation on Multiple Domains. WFLP 2000: 455-469
- [i1]Jan-Georg Smaus, Patricia M. Hill, Andy King: Verifying Termination and Error-Freedom of Logic Programs with block Declarations. CoRR cs.LO/0006033 (2000)
1990 – 1999
- 1999
- [c29]Antonio J. Fernández, Patricia M. Hill: Constraint Solving on Lattices. APPIA-GULP-PRODE 1999: 105-120
- [c28]Antonio J. Fernández, Patricia M. Hill: Extending clp(FD) by Negative Constraint Solving. APPIA-GULP-PRODE 1999: 137-150
- [c27]Roberto Bagnara, Enea Zaffanella, Patricia M. Hill: Enhancing Sharing for Precision. APPIA-GULP-PRODE 1999: 213-228
- [c26]Patricia M. Hill, Fausto Spoto: Freeness Analysis through Linear Refinement. APPIA-GULP-PRODE 1999: 321-337
- [c25]Enea Zaffanella, Roberto Bagnara, Patricia M. Hill: Widening Sharing. APPIA-GULP-PRODE 1999: 559-574
- [c24]Andy King, Jan-Georg Smaus, Patricia M. Hill: Quotienting Share for Dependency Analysis. ESOP 1999: 59-73
- [c23]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: 194-208
- [c22]Jan-Georg Smaus, Patricia M. Hill, Andy King: Mode Analysis Domains for Typed Logic Programs. LOPSTR 1999: 82-101
- [c21]
- [c20]Enea Zaffanella, Patricia M. Hill, Roberto Bagnara: Decomposing Non-redundant Sharing by Complementation. SAS 1999: 69-84
- [c19]
- 1998
- [c18]Patricia M. Hill, Roberto Bagnara, Enea Zaffanella: The Correctness of Set-Sharing. APPIA-GULP-PRODE 1998: 255-268
- [c17]Antonio J. Fernández, Patricia M. Hill: An Impartial Efficiency Comparison of FD Constraint Systems. CP 1998: 468
- [c16]Jan-Georg Smaus, Patricia M. Hill, Andy King: Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations. LOPSTR 1998: 289-307
- [c15]Jan-Georg Smaus, Patricia M. Hill, Andy King: Termination of Logic Programs with block Declarations Running in Several Modes. PLILP/ALP 1998: 73-88
- [c14]Patricia M. Hill, Roberto Bagnara, Enea Zaffanella: The Correctness of Set-Sharing. SAS 1998: 99-114
- 1997
- [j3]Patricia M. Hill, Andy King: Determinacy and determinacy analysis. J. Prog. Lang. 5(1): 135-171 (1997)
- [c13]
- [c12]Antonio J. Fernández, Patricia M. Hill: Boolean and Finite Domain Solvers Compared Using Self Referential Quizzes. APPIA-GULP-PRODE 1997: 533-544
- [c11]Jan-Georg Smaus, Patricia M. Hill, Andy King: Domain Construction for Mode Analysis of Typed Logic Programs. ICLP 1997: 418
- [c10]Andrew Heaton, Patricia M. Hill, Andy King: Analysis of Logic Programs with Delay. LOPSTR 1997: 148-167
- [c9]Antony F. Bowers, Patricia M. Hill, Francisco Ibañez: Resolution for Logic Programming with Universal Quantifiers. PLILP 1997: 63-77
- [c8]Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Set-Sharing is Redundant for Pair-Sharing. SAS 1997: 53-67
- 1994
- [b1]Patricia M. Hill, John W. Lloyd: The Gödel programming language. MIT Press 1994, ISBN 978-0-262-08229-7, pp. I-XX, 1-348
- [c7]
- 1993
- [j2]Kerima Benkerimi, Patricia M. Hill: Supporting Transformations for the Partial Evaluation of Logic Programs. J. Log. Comput. 3(5): 469-486 (1993)
- [c6]Patricia M. Hill: A Parameterised Module System for Constructing Typed Logic Programs. IJCAI 1993: 874-880
- [c5]
- 1992
- [p1]Patricia M. Hill, Rodney W. Topor: A Semantics for Typed Logic Programs. Types in Logic Programming 1992: 1-62
- [c4]
- [c3]
- [c2]Kerima Benkerimi, Patricia M. Hill: Object-Oriented Programming in Gödel: An Experiment. META 1992: 177-191
- 1990
- [j1]Patricia M. Hill, John W. Lloyd, John C. Shepherdson: Properties of a Pruning Operator. J. Log. Comput. 1(1): 99-143 (1990)
1980 – 1989
- 1988
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:11 CET by the dblp team