Publications

Bagnara, Roberto; Dobson, Katy; Hill, Patricia M; Mundell, Matthew; Zaffanella, Enea. Grids: a domain for analyzing the distribution of numerical values in: Puebla, G (editors) Logic-Based Program Synthesis and Transformation 16th International Symposium, LOPSTR 2006, pp. 219-235 Springer. 2007.

Bagnara, Roberto; Hill, Patricia M; Zaffanella, Enea. Widening operators for powerset domains. International Journal on Software Tools for Technology Transfer, vol. 10, pp. 449-466. 2006.

Hill, Patricia M; Spoto, Fausto. Deriving escape analysis by abstract interpretation. Higher-Order and Symbolic Computation, vol. 19, pp. 415-463. 2006.

Fernandez, A; Hill, Patricia M. An interval constraint branching scheme for lattice domains. Journal of Universal Computer Science, vol. 12, pp. 1466-1499. 2006.

Bagnara, Roberto; Zaffanella, Enea; Hill, Patricia M. Enhanced sharing analysis techniques: a comprehensive evaluation. Theory and Practice of Logic Programming, vol. 5, pp. 1-43. 2005.

Bagnara, Roberto; Hill, Patricia M; Zaffanella, Enea. Not necessarily closed convex polyhedra and the double description method. Formal Aspects of Computing, vol. 17, pp. 222-257. 2005.

Bagnara, Roberto; Hill, Patricia M; Ricci, Elisa; Zaffanella, Enea. Precise widening operators for convex polyhedra. Science of Computer Programming, vol. 58, pp. 28-56. 2005.

Bagnara, Roberto; Hill, Patricia M; Mazzi, Elena; Zaffanella, Enea. Widening operators for weakly-relational numeric abstractions in: Hankin, C and Siveroni, I (editors) Static Analysis, 12th International Symposium, SAS 2005, pp. 3-18 Springer. 2005.

Hill, Patricia M; Zaffanella, Enea; Bagnara, Roberto. A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages. Theory and Practice of Logic Programming, vol. 4, pp. 289-323. 2004.

Bagnara, Roberto; Gori, Roberta; Hill, Patricia M; Zaffanella, Enea. Finite-tree analysis for constraint logic-based languages. Information and Computation, vol. 193, pp. 84-116. 2004.

Fernandez, A; Hill, P M. An interval constraint system for lattice domains. ACM Transactions on Programming Languages and Systems, vol. 26, pp. 1-46. 2004.

Bagnara, R; Hill, P M; Zaffanella, E. Widening operators for powerset domains in: Steffen, B & Levi, G (editors) Verification, Model Checking and Abstract Interpretation: 5th International Conference, VMCAI 2004, pp. 135-148 Springer. 2004.

Hill, Patricia M; Spoto, Fausto. Logic programs as compact denotations in: Dahl, V & Wadler, P (editors) Practical Aspects of Declarative Languages: 5th International Symposium, PADL 2003, pp. 339-356 Springer. 2003.

Bagnara, Roberto; Hill, Patricia M; Ricci, Elisa; Zaffanella, E. Precise widening operators for convex polyhedra in: Cousot, R (editors) Static Analysis : 10th International Symposium, SAS 2003, pp. 337-354 Springer. 2003.

Hill, Patricia M; Bagnara, R; Zaffanella, E. A new encoding and implementation of not necessarily closed convex polyhedra in: Leuschel, M, Gruner, S & Lo Presti, S (editors) Proceedings of the 3rd Workshop on Automated Verification of Critical Systems (AVoCS), pp. 161-176 University of Southampton. 2003.

Hill, P M; Spoto, F. Logic programs as compact denotations. Computer Languages, Systems and Structures, vol. 29, pp. 45-73. 2003.

Bagnara, Roberto; Hill, Patricia M; Zaffanella, Enea. Set-sharing is redundant for pair-sharing. Theoretical Computer Science, vol. 277, pp. 3-46. 2002.

Hill, Patricia M; Spoto, Fausto. Generalizing def and pos to type analysis. Journal of Logic and Computation, vol. 12, pp. 497-542. 2002.

Hill, Patricia M; Spoto, Fausto. A foundation of escape analysis in: Proceedings AAAI-2000 - the 17th National Conference on Artificial Intelligence, pp. 380-395 AAAI Press. 2002.

Hill, Patricia M; Spoto, Fausto. A refinement of the escape property in: Cortesi, A (editors) Verification, Model Checking and Abstract Interpretation 3rd International Workshop VMCAI 2002, pp. 154-166 Springer. 2002.

Bagnara, Roberto; Ricci, Elisa; Hill, Patricia M; Zaffanella, Enea. Possibly not closed convex polyhedra and the Parma Polyhedra Library in: Hermemegildo, M & Puebla, G (editors) Static Analysis, 9th International Symposium SAS 2002, pp. 213-229 Springer. 2002.

Hill, P M; Bagnara, R; Zaffanella, E. Soundness, idempotence and commutativity of set-sharing. Theory and Practice of Logic Programming, vol. 2, pp. 155-202. 2002.

Zaffanella, E; Bagnara, R; Hill, P M. Decomposing non-redundant sharing by complementation. Theory and Practice of Logic Programming, vol. 2, pp. 233-261. 2002.

Smaus, Jan-Georg; Hill, Patricia M; King, Andy. Verifying termination and error-freedom of logic programs with block declarations. Theory and Practice of Logic Programming, vol. 1, pp. 447-485. 2001.

Bagnara, Roberto; Zaffanella, Enea; Hill, Patricia M; Gori, Roberta. Boolean functions for finite-tree dependencies in: Nieuwenhuis, E & Voronkov, A (editors) Logic for Programming, Artificial Intelligence and Reasoning 8th International Conference LPAR 2001 Proceedings, pp. 575-589 Springer. 2001.

Bagnara, Roberto; Gori, Roberta; Hill, P M; Zaffanella, Enea. Finite-tree analysis for constraint logic-based languages in: Cousot, P (editors) Static Analysis 8th International Symposium SAS 2001 Proceedings, pp. 165-184 Springer. 2001.

Bagnara, Roberto; Zaffanella, Enea; Hill, Patricia M. Enhancing sharing for precision in: Gabbrielli, M & Pfenning, F (editors) Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2000), pp. 103-114 ACM Press. 2000.

Fernandez, A; Hill, P M. A comparative study of eight constraint programming languages over the Boolean and finite domains. Constraints, vol. 5, pp. 275-301. 2000.

Heaton, A; Hill, P M; King, A. Abstract domains for universal and existential properties in: Smolka, G (editors) Programming Languages and Systems: 9th European Symposium on Programing (ESOP'2000), pp. 150-164 Springer. 2000.

Hill, P M; Spoto, F. Analysis of downward closed properties of logic programs in: Rus, T (editors) Algebraic Methodology and Software Technology, 8th International Conference AMAST'2000, pp. 181-196 Springer. 2000.

Bagnara, R; Zaffanella, E; Hill, P M. Enhanced sharing analysis techniques: A comprehensive evaluation in: Gabbrielli, M & Pfenning, F (editors) Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2000), pp. 103-114 ACM Press. 2000.

Bagnara, R; Hill, P M; Zaffanella, E. Efficient structural information analysis for real CLP languages in: Parigot, M & Voronkov, A (editors) Proceedings of the 7th Internatioanl Conference on Logic for Programming and Automated Reasoning, pp. 189-206 Springer. 2000.

King, A; Smaus, J-G; Hill, P. Quotienting share for dependency analysis in: Proceedings of the European Symposium on Programming, pp. 59-73 Springer. 1999.

Smaus, Jan-Georg; Hill, Pat; King, Andy. Preventing instantiation errors and loops for logic programs with several modes using block declarations in: Flener, P (editors) Logic Program Synthesis and Transformation, pp. 289-307 Springer. 1999.

Bagnara, Roberto; Zaffanella, Enea; Hill, Patricia M. Widening set-sharing in: Nadathur, G (editors) Principles and Practice of Declarative Programming: Proceedings of the First International Conference, pp. 414-431 Springer. 1999.

Zaffanella, E; Hill, P M; Bagnara, R. Decomposing non-redundant sharing by complementation in: Cortesi, A & File, G (editors) Static Analysis : Proceedings of the 6th International Symposium, pp. 69-84 Springer. 1999.

Hill, P M; SPOTO, F. Freeness analysis through linear refinement in: Cortesi, A & File, G (editors) Static Analysis : Proceedings of the 6th International Symposium, pp. 85-100 Springer. 1999.

Hill, P M; Gallagher, J G. Meta-programming in logic programming in: Gabbay, D, Hogger, C J & Robinson, J A (editors) Handbook of Logic in Artificial Intelligence and Logic Programming, pp. 412-497 Oxford University Press. 1998.

Heaton, A; Hill, P M; King, A. Analysing logic programs with delay for down-ward closed properties in: Clement, T & Lau, K.K. (editors) Logic Program Synthesis and Transformation, pp. 148-167 Springer. 1998.

Hill, P M; Bagnara, R; Zaffanella, E. The correctness of set sharing in: Levi, G (editors) Static Analysis, pp. 94-114 Springer. 1998.

Smaus, J-G; Hill, P M; King, A M. Termination of logic programs with block declarations running in several modes in: Palamidessi, C, Glaser, H & Meinke, K (editors) Principles of Declarative Programming, pp. 73-88 Springer. 1998.

Hill, P M; King, A. Detecting and exploiting determinacy in logic programs. Computational Logic, vol. 4, pp. 100-101. 1998.

Fernandez, A; Hill, P M. An impartial efficiency comparison of FD constraint systems in: Maher, M & Puget, J-F (editors) Principles and Practice of Constraint Programming - CP98, pp. 468 Springer. 1998.

Hill, P M; King, A M. Determinacy and determinacy analysis. Journal of Programming Languages, vol. 5, pp. 135-171. 1997.

Bowers, A; Hill, P M; Ibanez, F. Resolution for logic programming with universal quantifiers in: Glaser, H, Hartel, P & Kuchen, H (editors) Programming Languages: Implementations, Logics and Programs, pp. 63-77 Springer. 1997.

Bagnara, R; Hill, P M; Zaffanella, E. Set sharing is redundant for pair sharing in: van Hentenryck, P (editors) Static Analysis : 4th International Symposium, SAS'97, pp. 53-67 Springer. 1997.

Bagnara, R; Hill, P M; Zaffanella, E. Sharing revisited in: Proceedings of APPIA/GULP/PRODE 1997 Universita di Udine. 1997.

Fernandez, A; Hill, P M. Boolean and finite domain solvers compared using self-referential quizzes in: Proceedings of APPIA/GULP/PRODE 1997 Universita di Udine. 1997.

Barklund, J; Hill, P M. Logic programming with restricted quantification and arrays in: 1995 AISB Workshop on Automated Reasoning: Bridging the Gap between Theory and Practice, pp. 1-2 AISB. 1995.

Hill, P M; Lloyd, J. The Gödel Programming Language., 364pp MIT Press. 1994.

Hill, P M. Declarative meta-programming in: 1994 AISB Workshop on Automated Reasoning: Bridging the Gap between Theory and Practice, pp. 35-36 University of Leeds/AISB. 1994.

Hill, P M. A modular system for meta-programming in: Fribourg, L, Turin, F (editors) Logic Program Synthesis and Transformation - Meta-Programming in Logic, pp. 395-409 Springer. 1994.

Hill, P M. A parameterised module system for constructing typed logic programs in: Proceedings of the 13th International Joint Conference on Artificial Intelligence, vol. 2, pp. 874-880 Morgan Kaufman. 1993.

Hill, P M. The computation of typed logic programs and SLDNF-resolution in: Voronkov, A (editors) Logic Programming and Automated Reasoning, pp. 182-193 Springer. 1993.

Benkerimi, K; Hill, P M. Supporting transformations for the partial evaluation of logic programs. Journal of Logic and Computation, pp. 469-486. 1993.

Benkerimi, K; Hill, P M. Object-oriented programming in Gödel in: META'92 -Proceedings of the Third International Workshop on Meta-programming in Logic, pp. 101-116. 1992.

Bowers, A; Hill, P M. An introduction to Gödel in: Tutorial Papers ALPUK-92. 1992.

Benkerimi, K; Hill, P M. Object-oriented programming in Gödel in: Petterossi, A (editors) Meta-Programming in Logic, pp. 177-191 Springer. 1992.

Hill, P M. Pruning operators for partial evaluation in: Clement, T & Lau, K.K. (editors) Logic Program Synthesis and Transformation, pp. 183-204 Springer. 1992.

Hill, P M. Data structures and typed logic programs in: Neumann, B (editors) ECAI 92 - Proceedings of the 10th European Conference on Artificial Intelligence, pp. 109-113 John Wiley & Sons. 1992.

Hill, P M; Topor, R W. A semantics for typed logic programs in: Pfenning, F (editors) Types in Logic Programming, pp. 1-62 MIT Press. 1992.

Hill, P M. A taxonomy of type systems for logic programming languages in: Saint Dizier, P (editors) Proceedings of the ICLP'91 Workshop on Advanced Logic Programming Tools and Formalisms for Language Processing, pp. 25-43 INRIA. 1991.