| * | 2009 |
|---|
| 16 | EE | Philip J. Charles,
Jacob M. Howe,
Andy King:
Integer Polyhedra for Program Analysis.
AAIM 2009: 85-99 |
| 15 | EE | Jacob M. Howe,
Andy King:
Logahedra: A New Weakly Relational Domain.
ATVA 2009: 306-320 |
| 2004 |
|---|
| 14 | EE | Jacob M. Howe,
Andy King,
Lunjin Lu:
Analysing Logic Programs by Reasoning Backwards.
Program Development in Computational Logic 2004: 152-188 |
| 2003 |
|---|
| 13 | | Jacob M. Howe,
Andy King:
Efficient Groundness Analysis in Prolog.
TPLP 3(1): 95-124 (2003) |
| 12 | | Jacob M. Howe,
Andy King:
Three Optimisations for Sharing.
TPLP 3(2): 243-257 (2003) |
| 2002 |
|---|
| 11 | EE | Axel Simon,
Andy King,
Jacob M. Howe:
Two Variables per Linear Inequality as an Abstract Domain.
LOPSTR 2002: 71-89 |
| 10 | EE | Jacob M. Howe,
Andy King:
Efficient Groundness Analysis in Prolog
CoRR cs.PL/0201012: (2002) |
| 9 | EE | Jacob M. Howe,
Andy King:
Three Optimisations for Sharing
CoRR cs.PL/0203022: (2002) |
| 2001 |
|---|
| 8 | EE | Jacob M. Howe,
Andy King:
Positive Boolean Functions as Multiheaded Clauses.
ICLP 2001: 120-134 |
| 7 | | Jacob M. Howe:
Proof search in Lax Logic.
Mathematical Structures in Computer Science 11(4): 573-588 (2001) |
| 6 | | Samir Genaim,
Jacob M. Howe,
Michael Codish:
Worst-case groundness analysis using definite boolean functions.
TPLP 1(5): 611-615 (2001) |
| 2000 |
|---|
| 5 | EE | Jacob M. Howe,
Andy King:
Implementing Groundness Analysis with Definite Boolean Functions.
ESOP 2000: 200-214 |
| 4 | EE | Jacob M. Howe,
Andy King:
Abstracting numeric constraints with Boolean functions.
Inf. Process. Lett. 75(1-2): 17-23 (2000) |
| 1999 |
|---|
| 3 | | Jacob M. Howe,
Andy King:
Specialising Finite Domain Programs Using Polyhedra.
ECOOP Workshops 1999: 258-259 |
| 2 | | Jacob M. Howe,
Andy King:
Specialising Fininte Domain Programs Using Polyhedra.
LOPSTR 1999: 118-135 |
| 1997 |
|---|
| 1 | | Jacob M. Howe:
Two Loop Detection Mechanisms: A Comparision.
TABLEAUX 1997: 188-200 |
