Travelled to:1 × Germany
1 × Japan
1 × Spain
1 × The Netherlands
2 × Belgium
3 × France
3 × USA
3 × United Kingdom
7 × Italy
Collaborated with:R.Bagnara E.Zaffanella A.King J.Smaus F.Spoto A.Heaton E.Ricci A.J.Fernández ∅ A.F.Bowers F.Ibañez E.Mazzi R.Gori K.Dobson M.Mundell
Talks about:program (8) logic (8) analysi (7) share (7) domain (5) widen (4) mode (4) constraint (3) polyhedra (3) oper (3)
Person: Patricia M. Hill
DBLP: Hill:Patricia_M=
Facilitated 2 volumes:
Ed
EdContributed to:
20082006
20052004
20032003200220022001
2000
20001999
199919991999199919981998199819971997199719971994Wrote 25 papers:
- VMCAI-2008-BagnaraHZ #algorithm #constraints #integer
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints (RB, PMH, EZ), pp. 8–21.
- LOPSTR-2006-BagnaraDHMZ #named
- Grids: A Domain for Analyzing the Distribution of Numerical Values (RB, KD, PMH, MM, EZ), pp. 219–235.
- SAS-2005-BagnaraHMZ #abstraction
- Widening Operators for Weakly-Relational Numeric Abstractions (RB, PMH, EM, EZ), pp. 3–18.
- VMCAI-2004-BagnaraHZ #set
- Widening Operators for Powerset Domains (RB, PMH, EZ), pp. 135–148.
- PADL-2003-HillS #logic programming #source code
- Logic Programs as Compact Denotations (PMH, FS), pp. 339–356.
- SAS-2003-BagnaraHRZ #precise
- Precise Widening Operators for Convex Polyhedra (RB, PMH, ER, EZ), pp. 337–354.
- SAS-2002-BagnaraRZH #library
- Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library (RB, ER, EZ, PMH), pp. 213–229.
- VMCAI-2002-HillS #refinement
- A Refinement of the Escape Property (PMH, FS), pp. 154–166.
- SAS-2001-BagnaraGHZ #analysis #constraints
- Finite-Tree Analysis for Constraint Logic-Based Languages (RB, RG, PMH, EZ), pp. 165–184.
- ESOP-2000-HeatonHK #abstract domain
- Abstract Domains for Universal and Existential Properties (AH, PMH, AK), pp. 150–164.
- PPDP-2000-BagnaraZH #analysis #evaluation
- Enhanced sharing analysis techniques: a comprehensive evaluation (RB, EZ, PMH), pp. 103–114.
- ESOP-1999-KingSH #analysis #dependence
- Quotienting Share for Dependency Analysis (AK, JGS, PMH), pp. 59–73.
- FLOPS-1999-FernandezH #constraints #framework #theorem proving
- An Interval Lattice-Based Constraint Solving Framework for Lattices (AJF, PMH), pp. 194–208.
- LOPSTR-1999-SmausHK #analysis #logic programming #source code
- Mode Analysis Domains for Typed Logic Programs (JGS, PMH, AK), pp. 82–101.
- PPDP-1999-ZaffanellaBH
- Widening Sharing (EZ, RB, PMH), pp. 414–432.
- SAS-1999-HillS #analysis #linear #refinement
- Freeness Analysis Through Linear Refinement (PMH, FS), pp. 85–100.
- SAS-1999-ZaffanellaHB
- Decomposing Non-redundant Sharing by Complementation (EZ, PMH, RB), pp. 69–84.
- ALP-PLILP-1998-SmausHK #logic programming #source code #termination
- Termination of Logic Programs with block Declarations Running in Several Modes (JGS, PMH, AK), pp. 73–88.
- LOPSTR-1998-SmausHK #fault #logic programming #multi #source code #using
- Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations (JGS, PMH, AK), pp. 289–307.
- SAS-1998-HillBZ #correctness
- The Correctness of Set-Sharing (PMH, RB, EZ), pp. 99–114.
- ICLP-1997-SmausHK #analysis #logic programming #source code
- Domain Construction for Mode Analysis of Typed Logic Programs (JGS, PMH, AK), p. 418.
- LOPSTR-1997-HeatonHK #analysis #logic programming #source code
- Analysis of Logic Programs with Delay (AH, PMH, AK), pp. 148–167.
- PLILP-1997-BowersHI #logic programming #quantifier
- Resolution for Logic Programming with Universal Quantifiers (AFB, PMH, FI), pp. 63–77.
- SAS-1997-BagnaraHZ
- Set-Sharing is Redundant for Pair-Sharing (RB, PMH, EZ), pp. 53–67.
- LOPSTR-1994-Hill #metaprogramming
- A Module System for Meta-Programming (PMH), pp. 395–409.