The following pages link to Andy King (Q294783):
Displaying 50 items.
- Abstracting numeric constraints with Boolean functions (Q294784) (← links)
- A pearl on SAT and SMT solving in Prolog (Q428887) (← links)
- Partial evaluation of string obfuscations for Java malware detection (Q511016) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- Abstract interpretation of microcontroller code: intervals meet congruences (Q2442953) (← links)
- Reducing bit-vector polynomials to SAT using Gröbner bases (Q2661363) (← links)
- (Q2723918) (← links)
- (Q2723920) (← links)
- (Q2757844) (← links)
- Range and Set Abstraction using SAT (Q2814098) (← links)
- Quadtrees as an Abstract Domain (Q2814109) (← links)
- Mutual Exclusion by Interpolation (Q2900264) (← links)
- Partial Evaluation for Java Malware Detection (Q2949704) (← links)
- Analyzing String Buffers in C (Q2996136) (← links)
- Two Variables per Linear Inequality as an Abstract Domain (Q3079912) (← links)
- RedAlert: Determinacy inference for Prolog (Q3087441) (← links)
- Lazy Set-Sharing Analysis (Q3434632) (← links)
- Inferring Congruence Equations Using SAT (Q3512500) (← links)
- A Pearl on SAT Solving in Prolog (Q3558337) (← links)
- Taming the Wrapping of Integer Arithmetic (Q3611998) (← links)
- Logahedra: A New Weakly Relational Domain (Q3648708) (← links)
- Automatic Abstraction for Congruences (Q3656884) (← links)
- (Q4411952) (← links)
- (Q4417885) (← links)
- Efficient groundness analysis in Prolog (Q4452593) (← links)
- Three optimisations for sharing (Q4452604) (← links)
- A backward analysis for constraint logic programs (Q4452607) (← links)
- Verifying termination and error-freedom of logic programs with <i>block</i> declarations (Q4452637) (← links)
- A simple polynomial groundness analysis for logic programs (Q4507857) (← links)
- (Q4518879) (← links)
- (Q4518882) (← links)
- Pair-sharing over rational trees (Q4520179) (← links)
- Computing convex hulls with a linear solver (Q4673547) (← links)
- (Q4736508) (← links)
- Convex hull of planar<i>h</i>-polyhedra (Q4831398) (← links)
- Automatic Abstraction for Intervals Using Boolean Formulae (Q4930724) (← links)
- (Q4944867) (← links)
- Mind the Gap: Bit-vector Interpolation recast over Linear Integer Arithmetic (Q5039504) (← links)
- Compact Difference Bound Matrices (Q5056006) (← links)
- Semantics for Prolog with Cut – Revisited (Q5170718) (← links)
- Logic Programming (Q5191488) (← links)
- Inferring non-suspension conditions for logic programs with dynamic scheduling (Q5277806) (← links)
- Functional and Logic Programming (Q5308018) (← links)
- Programming Languages and Systems (Q5316587) (← links)
- Widening Polyhedra with Landmarks (Q5385594) (← links)
- Detecting Determinacy in Prolog Programs (Q5449597) (← links)
- Collapsing Closures (Q5449598) (← links)
- (Q5472914) (← links)
- Program Development in Computational Logic (Q5712540) (← links)
