Patricia M. Hill

From MaRDI portal
Revision as of 11:30, 23 September 2023 by Import230922100944 (talk | contribs) (Created automatically from import230922100944)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:817223

Available identifiers

zbMath Open hill.patricia-mMaRDI QIDQ817223

List of research outcomes





PublicationDate of PublicationType
A Foundation of Escape Analysis*2011-05-06Paper
Boolean Functions for Finite-Tree Dependencies2011-05-06Paper
Exact join detection for convex polyhedra and other numerical abstractions2010-03-11Paper
Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness2010-02-05Paper
Applications of polyhedral computations to the analysis and verification of hardware and software systems2009-11-04Paper
Verification, Model Checking, and Abstract Interpretation2009-05-15Paper
An Improved Tight Closure Algorithm for Integer Octagonal Constraints2008-04-04Paper
Grids: A Domain for Analyzing the Distribution of Numerical Values2007-09-10Paper
Deriving escape analysis by abstract interpretation2007-01-05Paper
Static Analysis2006-10-31Paper
Finite-tree analysis for constraint logic-based languages2006-03-07Paper
Not necessarily closed convex polyhedra and the double description method2005-12-13Paper
Precise widening operators for convex polyhedra2005-10-10Paper
Enhanced sharing analysis techniques: a comprehensive evaluation2005-04-29Paper
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages2005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q48134072004-08-13Paper
https://portal.mardi4nfdi.de/entity/Q47369942004-08-11Paper
Logic programs as compact denotations.2004-03-14Paper
Soundness, idempotence and commutativity of set-sharing2004-03-01Paper
Decomposing non-redundant sharing by complementation2004-03-01Paper
Verifying termination and error-freedom of logic programs with block declarations2004-03-01Paper
https://portal.mardi4nfdi.de/entity/Q44151182003-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44119602003-07-13Paper
https://portal.mardi4nfdi.de/entity/Q47787012002-11-19Paper
Generalizing Def and Pos to Type Analysis2002-08-12Paper
https://portal.mardi4nfdi.de/entity/Q27667802002-07-22Paper
https://portal.mardi4nfdi.de/entity/Q27670172002-07-22Paper
Set-sharing is redundant for pair-sharing2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q27671732002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q27239182001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q44943742001-03-25Paper
https://portal.mardi4nfdi.de/entity/Q44943752001-03-25Paper
https://portal.mardi4nfdi.de/entity/Q45188792000-12-03Paper
A comparative study of eight constraint programming languages over the Boolean and finite domains2000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q44943732000-08-10Paper
https://portal.mardi4nfdi.de/entity/Q48441681995-08-21Paper
Supporting Transformations for the Partial Evaluation of Logic Programs1994-12-11Paper
https://portal.mardi4nfdi.de/entity/Q42825171994-03-17Paper
Properties of a Pruning Operator1990-01-01Paper
On the T(q)-conditions of small cancellation theory1985-01-01Paper
A residual property of free groups1983-01-01Paper

Research outcomes over time

This page was built for person: Patricia M. Hill