The following pages link to Patricia M. Hill (Q817223):
Displaying 43 items.
- Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- Deriving escape analysis by abstract interpretation (Q857916) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- (Q1070341) (redirect page) (← links)
- On the T(q)-conditions of small cancellation theory (Q1070343) (← links)
- Logic programs as compact denotations. (Q1426046) (← links)
- A comparative study of eight constraint programming languages over the Boolean and finite domains (Q1579086) (← links)
- Set-sharing is redundant for pair-sharing (Q1605223) (← links)
- (Q1838570) (redirect page) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- Precise widening operators for convex polyhedra (Q2568443) (← links)
- Not necessarily closed convex polyhedra and the double description method (Q2576576) (← links)
- (Q2723918) (← links)
- (Q2766780) (← links)
- (Q2767017) (← links)
- (Q2767173) (← links)
- A Foundation of Escape Analysis* (Q2996125) (← links)
- Boolean Functions for Finite-Tree Dependencies (Q2996195) (← links)
- Grids: A Domain for Analyzing the Distribution of Numerical Values (Q3591087) (← links)
- (Q4282517) (← links)
- Supporting Transformations for the Partial Evaluation of Logic Programs (Q4286220) (← links)
- (Q4411960) (← links)
- (Q4415118) (← links)
- Soundness, idempotence and commutativity of set-sharing (Q4452614) (← links)
- Decomposing non-redundant sharing by complementation (Q4452616) (← links)
- Verifying termination and error-freedom of logic programs with <i>block</i> declarations (Q4452637) (← links)
- (Q4494373) (← links)
- (Q4494374) (← links)
- (Q4494375) (← links)
- (Q4518879) (← links)
- Generalizing Def and Pos to Type Analysis (Q4542943) (← links)
- A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages (Q4669646) (← links)
- Enhanced sharing analysis techniques: a comprehensive evaluation (Q4673538) (← links)
- (Q4736994) (← links)
- (Q4778701) (← links)
- (Q4813407) (← links)
- (Q4844168) (← links)
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints (Q5452703) (← links)
- Properties of a Pruning Operator (Q5750389) (← links)
- Static Analysis (Q5897425) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5901909) (← links)
- A residual property of free groups (Q5917308) (← links)
