The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Patricia M. Hill: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    Sharing Revisited. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1997, pp:69-80 [Conf]
  2. Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
    Enhancing Sharing for Precision. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:213-228 [Conf]
  3. Antonio J. Fernández, Patricia M. Hill
    Boolean and Finite Domain Solvers Compared Using Self Referential Quizzes. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1997, pp:533-544 [Conf]
  4. Antonio J. Fernández, Patricia M. Hill
    Constraint Solving on Lattices. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:105-120 [Conf]
  5. Antonio J. Fernández, Patricia M. Hill
    Extending clp(FD) by Negative Constraint Solving. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:137-150 [Conf]
  6. Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
    The Correctness of Set-Sharing. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1998, pp:255-268 [Conf]
  7. Patricia M. Hill, Fausto Spoto
    Freeness Analysis through Linear Refinement. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:321-337 [Conf]
  8. Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
    Widening Sharing. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:559-574 [Conf]
  9. Antony F. Bowers, Patricia M. Hill
    An Introduction to Gödel. [Citation Graph (0, 0)][DBLP]
    ALPUK, 1992, pp:299-343 [Conf]
  10. Patricia M. Hill, Fausto Spoto
    Analysis of Downward Closed Properties of Logic Programs. [Citation Graph (0, 0)][DBLP]
    AMAST, 2000, pp:181-196 [Conf]
  11. Patricia M. Hill, Fausto Spoto
    A Foundation of Escape Analysis. [Citation Graph (0, 0)][DBLP]
    AMAST, 2002, pp:380-395 [Conf]
  12. Antonio J. Fernández, Patricia M. Hill
    An Impartial Efficiency Comparison of FD Constraint Systems. [Citation Graph (0, 0)][DBLP]
    CP, 1998, pp:468- [Conf]
  13. Patricia M. Hill
    Data Structures and Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    ECAI, 1992, pp:109-113 [Conf]
  14. Andy King, Jan-Georg Smaus, Patricia M. Hill
    Quotienting Share for Dependency Analysis. [Citation Graph (0, 0)][DBLP]
    ESOP, 1999, pp:59-73 [Conf]
  15. Andrew Heaton, Patricia M. Hill, Andy King
    Abstract Domains for Universal and Existential Properties. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:150-164 [Conf]
  16. Antonio J. Fernández, Patricia M. Hill
    An Interval Lattice-Based Constraint Solving Framework for Lattices. [Citation Graph (0, 0)][DBLP]
    Fuji International Symposium on Functional and Logic Programming, 1999, pp:194-208 [Conf]
  17. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Domain Construction for Mode Analysis of Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1997, pp:418- [Conf]
  18. Patricia M. Hill
    A Parameterised Module System for Constructing Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1993, pp:874-880 [Conf]
  19. Andrew Heaton, Patricia M. Hill, Andy King
    Analysis of Logic Programs with Delay. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1997, pp:148-167 [Conf]
  20. Patricia M. Hill
    A Module System for Meta-Programming. [Citation Graph (0, 0)][DBLP]
    META, 1994, pp:395-409 [Conf]
  21. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1998, pp:289-307 [Conf]
  22. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Mode Analysis Domains for Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1999, pp:82-101 [Conf]
  23. Roberto Bagnara, Katy Dobson, Patricia M. Hill, Matthew Mundell, Enea Zaffanella
    Grids: A Domain for Analyzing the Distribution of Numerical Values. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2006, pp:219-235 [Conf]
  24. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    Efficient Structural Information Analysis for Real CLP Languages. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:189-206 [Conf]
  25. Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill
    Boolean Functions for Finite-Tree Dependencies. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:579-594 [Conf]
  26. Patricia M. Hill
    The Completion of Typed Logic Programs and SLDNF-Resolution. [Citation Graph (0, 0)][DBLP]
    LPAR, 1993, pp:182-193 [Conf]
  27. Kerima Benkerimi, Patricia M. Hill
    Object-Oriented Programming in Gödel: An Experiment. [Citation Graph (0, 0)][DBLP]
    META, 1992, pp:177-191 [Conf]
  28. Patricia M. Hill, John W. Lloyd
    Analysis of Meta-Programs. [Citation Graph (0, 0)][DBLP]
    META, 1988, pp:23-51 [Conf]
  29. Patricia M. Hill, Fausto Spoto
    Logic Programs as Compact Denotations. [Citation Graph (0, 0)][DBLP]
    PADL, 2003, pp:339-356 [Conf]
  30. Antony F. Bowers, Patricia M. Hill, Francisco Ibañez
    Resolution for Logic Programming with Universal Quantifiers. [Citation Graph (0, 0)][DBLP]
    PLILP, 1997, pp:63-77 [Conf]
  31. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Termination of Logic Programs with block Declarations Running in Several Modes. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:73-88 [Conf]
  32. Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
    Enhanced sharing analysis techniques: a comprehensive evaluation. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:103-114 [Conf]
  33. Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
    Widening Sharing. [Citation Graph (0, 0)][DBLP]
    PPDP, 1999, pp:414-432 [Conf]
  34. Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella
    Finite-Tree Analysis for Constraint Logic-Based Languages. [Citation Graph (0, 0)][DBLP]
    SAS, 2001, pp:165-184 [Conf]
  35. Roberto Bagnara, Patricia M. Hill, Elena Mazzi, Enea Zaffanella
    Widening Operators for Weakly-Relational Numeric Abstractions. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:3-18 [Conf]
  36. Roberto Bagnara, Patricia M. Hill, Elisa Ricci, Enea Zaffanella
    Precise Widening Operators for Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:337-354 [Conf]
  37. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    Set-Sharing is Redundant for Pair-Sharing. [Citation Graph (0, 0)][DBLP]
    SAS, 1997, pp:53-67 [Conf]
  38. Roberto Bagnara, Elisa Ricci, Enea Zaffanella, Patricia M. Hill
    Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:213-229 [Conf]
  39. Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
    The Correctness of Set-Sharing. [Citation Graph (0, 0)][DBLP]
    SAS, 1998, pp:99-114 [Conf]
  40. Patricia M. Hill, Fausto Spoto
    Freeness Analysis Through Linear Refinement. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:85-100 [Conf]
  41. Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
    Decomposing Non-redundant Sharing by Complementation. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:69-84 [Conf]
  42. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    Widening Operators for Powerset Domains. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2004, pp:135-148 [Conf]
  43. Patricia M. Hill, Fausto Spoto
    A Refinement of the Escape Property. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2002, pp:154-166 [Conf]
  44. Antonio J. Fernández, Patricia M. Hill
    Constraint Propagation on Multiple Domains. [Citation Graph (0, 0)][DBLP]
    WFLP, 2000, pp:455-469 [Conf]
  45. Patricia M. Hill, Fausto Spoto
    Logic programs as compact denotations. [Citation Graph (0, 0)][DBLP]
    Computer Languages, Systems & Structures, 2003, v:29, n:3, pp:45-73 [Journal]
  46. Antonio J. Fernández, Patricia M. Hill
    A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains. [Citation Graph (0, 0)][DBLP]
    Constraints, 2000, v:5, n:3, pp:275-301 [Journal]
  47. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Verifying Termination and Error-Freedom of Logic Programs with block Declarations [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  48. Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
    Decomposing Non-Redundant Sharing by Complementation [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  49. Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
    Soundness, Idempotence and Commutativity of Set-Sharing [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  50. Antonio J. Fernández, Patricia M. Hill
    Branching: the Essence of Constraint Solving [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  51. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  52. Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
    Enhanced sharing analysis techniques: a comprehensive evaluation [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  53. Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella
    Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  54. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    Not necessarily closed convex polyhedra and the double description method. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2005, v:17, n:2, pp:222-257 [Journal]
  55. Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella
    Finite-tree analysis for constraint logic-based languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:193, n:2, pp:84-116 [Journal]
  56. Antonio Brogi, Patricia M. Hill
    Special Issue on Logical Formalisms for Program Composition - Editorial. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 2000, v:2000, n:2, pp:- [Journal]
  57. Patricia M. Hill, Andy King
    Determinacy and determinacy analysis. [Citation Graph (0, 0)][DBLP]
    J. Prog. Lang., 1997, v:5, n:1, pp:135-171 [Journal]
  58. Antonio J. Fernández, Patricia M. Hill
    An Interval Constraint Branching Scheme for Lattice Domains. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2006, v:12, n:11, pp:1466-1499 [Journal]
  59. Patricia M. Hill, Fausto Spoto
    Deriving escape analysis by abstract interpretation. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2006, v:19, n:4, pp:415-463 [Journal]
  60. Kerima Benkerimi, Patricia M. Hill
    Supporting Transformations for the Partial Evaluation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1993, v:3, n:5, pp:469-486 [Journal]
  61. Patricia M. Hill, John W. Lloyd, John C. Shepherdson
    Properties of a Pruning Operator. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1990, v:1, n:1, pp:99-143 [Journal]
  62. Patricia M. Hill, Fausto Spoto
    Generalizing Def and Pos to Type Analysis. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:3, pp:497-542 [Journal]
  63. Roberto Bagnara, Patricia M. Hill, Elisa Ricci, Enea Zaffanella
    Precise widening operators for convex polyhedra. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2005, v:58, n:1-2, pp:28-56 [Journal]
  64. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    Widening operators for powerset domains. [Citation Graph (0, 0)][DBLP]
    STTT, 2006, v:8, n:4-5, pp:449-466 [Journal]
  65. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    Set-sharing is redundant for pair-sharing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:277, n:1-2, pp:3-46 [Journal]
  66. Antonio J. Fernández, Patricia M. Hill
    An interval constraint system for lattice domains. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2004, v:26, n:1, pp:1-46 [Journal]
  67. Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
    Enhanced sharing analysis techniques: a comprehensive evaluation. [Citation Graph (0, 0)][DBLP]
    TPLP, 2005, v:5, n:1-2, pp:1-43 [Journal]
  68. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Verifying Termination and Error-Freedom of Logic Programs with block Declarations. [Citation Graph (0, 0)][DBLP]
    TPLP, 2001, v:1, n:4, pp:447-486 [Journal]
  69. Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
    Soundness, idempotence and commutativity of set-sharing. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:2, pp:155-201 [Journal]
  70. 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. [Citation Graph (0, 0)][DBLP]
    TPLP, 2004, v:4, n:3, pp:289-323 [Journal]
  71. Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
    Decomposing non-redundant sharing by complementation. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:2, pp:233-261 [Journal]
  72. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  73. Roberto Bagnara, Patricia M. Hill, Andrea Pescetti, Enea Zaffanella
    On the Design of Generic Static Analyzers for Modern Imperative Languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  74. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    An Improved Tight Closure Algorithm for Integer Octagonal Constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  75. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  76. Patricia M. Hill, Fausto Spoto
    Deriving Escape Analysis by Abstract Interpretation: Proofs of results [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  77. Roberto Bagnara, Patricia M. Hill, Elena Mazzi, Enea Zaffanella
    Widening Operators for Weakly-Relational Numeric Abstractions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  78. Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
    Widening operators for powerset domains. [Citation Graph (0, 0)][DBLP]
    STTT, 2007, v:9, n:3-4, pp:413-414 [Journal]

  79. An Improved Tight Closure Algorithm for Integer Octagonal Constraints. [Citation Graph (, )][DBLP]


  80. Exact join detection for convex polyhedra and other numerical abstractions. [Citation Graph (, )][DBLP]


  81. A Prolog-based Environment for Reasoning about Programming Languages (Extended abstract) [Citation Graph (, )][DBLP]


  82. Proceedings of the 17th Workshop on Logic-based methods in Programming Environments (WLPE 2007) [Citation Graph (, )][DBLP]


  83. Exact Join Detection for Convex Polyhedra and Other Numerical Abstractions [Citation Graph (, )][DBLP]


Search in 0.087secs, Finished in 0.093secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002