2009 |
65 | EE | Andy King:
Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry
CoRR abs/0903.2353: (2009) |
2008 |
64 | | Andy King:
Logic-Based Program Synthesis and Transformation, 17th International Symposium, LOPSTR 2007, Kongens Lyngby, Denmark, August 23-24, 2007, Revised Selected Papers
Springer 2008 |
63 | EE | Andy King,
Harald Søndergaard:
Inferring Congruence Equations Using SAT.
CAV 2008: 281-293 |
62 | EE | Samir Genaim,
Andy King:
Inferring non-suspension conditions for logic programs with dynamic scheduling.
ACM Trans. Comput. Log. 9(3): (2008) |
61 | EE | Neil Kettle,
Andy King:
An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs.
IEEE Trans. on CAD of Integrated Circuits and Systems 27(4): 764-777 (2008) |
2007 |
60 | EE | Axel Simon,
Andy King:
Taming the Wrapping of Integer Arithmetic.
SAS 2007: 121-136 |
2006 |
59 | EE | Axel Simon,
Andy King:
Widening Polyhedra with Landmarks.
APLAS 2006: 166-182 |
58 | EE | Neil Kettle,
Andy King:
An anytime symmetry detection algorithm for ROBDDs.
ASP-DAC 2006: 243-248 |
57 | EE | Xuan Li,
Andy King,
Lunjin Lu:
Lazy Set-Sharing Analysis.
FLOPS 2006: 177-191 |
56 | EE | Andy King,
Lunjin Lu,
Samir Genaim:
Detecting Determinacy in Prolog Programs.
ICLP 2006: 132-147 |
55 | EE | Xuan Li,
Andy King,
Lunjin Lu:
Collapsing Closures.
ICLP 2006: 148-162 |
54 | EE | Neil Kettle,
Andy King,
Tadeusz Strzemecki:
Widening ROBDDs with Prime Implicants.
TACAS 2006: 105-119 |
53 | EE | Andy King,
Jonathan C. Martin:
Control Generation by Program Transformation.
Fundam. Inform. 69(1-2): 179-218 (2006) |
52 | EE | Olivier Danvy,
Andrzej Filinski,
Jean-Louis Giavitto,
Andy King,
Pierre-Etienne Moreau,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 19(4): 343-344 (2006) |
2005 |
51 | EE | Lunjin Lu,
Andy King:
Determinacy Inference for Logic Programs.
ESOP 2005: 108-123 |
50 | EE | Axel Simon,
Andy King:
Exploiting Sparsity in Polyhedral Analysis.
SAS 2005: 336-351 |
49 | EE | Florence Benoy,
Andy King,
Frédéric Mesnard:
Computing convex hulls with a linear solver.
TPLP 5(1-2): 259-271 (2005) |
2004 |
48 | EE | Lunjin Lu,
Andy King:
Backward Pair Sharing Analysis.
FLOPS 2004: 132-146 |
47 | EE | Jacob M. Howe,
Andy King,
Lunjin Lu:
Analysing Logic Programs by Reasoning Backwards.
Program Development in Computational Logic 2004: 152-188 |
46 | EE | Jonathan C. Martin,
Andy King:
On the Inference of Natural Level Mappings.
Program Development in Computational Logic 2004: 432-452 |
45 | EE | Axel Simon,
Andy King:
Convex Hull of Planar H-Polyhedra
CoRR cs.CG/0405089: (2004) |
44 | EE | Axel Simon,
Andy King:
Convex hull of planar h-polyhedra.
Int. J. Comput. Math. 81(3): 259-271 (2004) |
2003 |
43 | EE | Samir Genaim,
Andy King:
Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling.
ESOP 2003: 84-98 |
42 | EE | Andy King,
Lunjin Lu:
Forward versus Backward Verification of Logic Programs.
ICLP 2003: 315-330 |
41 | EE | Florence Benoy,
Andy King,
Frédéric Mesnard:
Computing Convex Hulls with a Linear Solver
CoRR cs.PL/0311002: (2003) |
40 | | Jacob M. Howe,
Andy King:
Efficient Groundness Analysis in Prolog.
TPLP 3(1): 95-124 (2003) |
39 | | Jacob M. Howe,
Andy King:
Three Optimisations for Sharing.
TPLP 3(2): 243-257 (2003) |
2002 |
38 | EE | Axel Simon,
Andy King:
Analyzing String Buffers in C.
AMAST 2002: 365-379 |
37 | EE | Axel Simon,
Andy King,
Jacob M. Howe:
Two Variables per Linear Inequality as an Abstract Domain.
LOPSTR 2002: 71-89 |
36 | EE | Lunjin Lu,
Andy King:
Backward Type Inference Generalises Type Checking.
SAS 2002: 85-101 |
35 | EE | Andy King,
Lunjin Lu:
A Backward Analysis for Constraint Logic Programs
CoRR cs.PL/0201011: (2002) |
34 | EE | Jacob M. Howe,
Andy King:
Efficient Groundness Analysis in Prolog
CoRR cs.PL/0201012: (2002) |
33 | EE | Jacob M. Howe,
Andy King:
Three Optimisations for Sharing
CoRR cs.PL/0203022: (2002) |
32 | | Andy King,
Lunjin Lu:
A Backward Analysis for Constraint Logic Programs.
TPLP 2(4-5): 517-547 (2002) |
2001 |
31 | EE | Jacob M. Howe,
Andy King:
Positive Boolean Functions as Multiheaded Clauses.
ICLP 2001: 120-134 |
30 | | Jan-Georg Smaus,
Patricia M. Hill,
Andy King:
Verifying Termination and Error-Freedom of Logic Programs with block Declarations.
TPLP 1(4): 447-486 (2001) |
2000 |
29 | EE | Andrew Heaton,
Patricia M. Hill,
Andy King:
Abstract Domains for Universal and Existential Properties.
ESOP 2000: 150-164 |
28 | EE | Jacob M. Howe,
Andy King:
Implementing Groundness Analysis with Definite Boolean Functions.
ESOP 2000: 200-214 |
27 | EE | Jan-Georg Smaus,
Patricia M. Hill,
Andy King:
Verifying Termination and Error-Freedom of Logic Programs with block Declarations
CoRR cs.LO/0006033: (2000) |
26 | EE | Jacob M. Howe,
Andy King:
Abstracting numeric constraints with Boolean functions.
Inf. Process. Lett. 75(1-2): 17-23 (2000) |
25 | | Andy Heaton,
Muhamed Abo-Zaed,
Michael Codish,
Andy King:
A simple polynomial groundness analysis for logic programs.
J. Log. Program. 45(1-3): 143-156 (2000) |
24 | | Andy King:
Pair-sharing over rational trees.
J. Log. Program. 46(1-2): 139-155 (2000) |
1999 |
23 | | Jacob M. Howe,
Andy King:
Specialising Finite Domain Programs Using Polyhedra.
ECOOP Workshops 1999: 258-259 |
22 | EE | Andy King,
Jan-Georg Smaus,
Patricia M. Hill:
Quotienting Share for Dependency Analysis.
ESOP 1999: 59-73 |
21 | | Jacob M. Howe,
Andy King:
Specialising Fininte Domain Programs Using Polyhedra.
LOPSTR 1999: 118-135 |
20 | | Jan-Georg Smaus,
Patricia M. Hill,
Andy King:
Mode Analysis Domains for Typed Logic Programs.
LOPSTR 1999: 82-101 |
19 | | Kish Shen,
Vítor Santos Costa,
Andy King:
Distance: A New Metric for Controlling Granularity for Parallel Execution.
Journal of Functional and Logic Programming 1999(Special Issue 1): (1999) |
1998 |
18 | | Kish Shen,
Vítor Santos Costa,
Andy King:
Distance: A New Metric for Controlling Granularity for Parallel Execution.
IJCSLP 1998: 85-99 |
17 | EE | Jan-Georg Smaus,
Patricia M. Hill,
Andy King:
Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations.
LOPSTR 1998: 289-307 |
16 | EE | Jan-Georg Smaus,
Patricia M. Hill,
Andy King:
Termination of Logic Programs with block Declarations Running in Several Modes.
PLILP/ALP 1998: 73-88 |
1997 |
15 | | Jan-Georg Smaus,
Patricia M. Hill,
Andy King:
Domain Construction for Mode Analysis of Typed Logic Programs.
ICLP 1997: 418 |
14 | | Andy King,
Kish Shen,
Florence Benoy:
Lower-bound Time-complexity Analysis of Logic Programs.
ILPS 1997: 261-275 |
13 | EE | Andrew Heaton,
Patricia M. Hill,
Andy King:
Analysis of Logic Programs with Delay.
LOPSTR 1997: 148-167 |
12 | | Jonathan C. Martin,
Andy King:
Generating Efficient, Terminating Logic Programs.
TAPSOFT 1997: 273-284 |
11 | EE | Patricia M. Hill,
Andy King:
Determinacy and determinacy analysis.
J. Prog. Lang. 5(1): 135-171 (1997) |
1996 |
10 | | Florence Benoy,
Andy King:
Inferring Argument Size Relationships with CLP(R).
LOPSTR 1996: 204-223 |
9 | | Jonathan C. Martin,
Andy King,
Paul Soper:
Typed Norms for Typed Logic Programs.
LOPSTR 1996: 224-238 |
1994 |
8 | | Andy King:
A Synergistic Analysis for Sharing and Groundness with Traces Linearity.
ESOP 1994: 363-378 |
7 | | Andy King,
Paul Soper:
Depth-k Sharing and Freeness.
ICLP 1994: 553-568 |
1993 |
6 | | Andy King:
A Framework for Sharing Analysis.
ICLP-Workshops on Implementation of Logic Programming Systems 1993: 137-149 |
1992 |
5 | | Andy King,
Paul Soper:
Serialisation Analysis of Concurrent Logic Programs.
ALP 1992: 322-334 |
4 | | Andy King,
Paul Soper:
Schedule Analysis of Concurrent Logic programs.
JICSLP 1992: 478-492 |
3 | | Andy King,
Paul Soper:
Ordering Optimizations for Concurrent Logic Programs.
LFCS 1992: 221-228 |
1991 |
2 | | Andy King,
Paul Soper:
Reducing Scheduling Overheads for Concurrent Logic Programs.
PDK 1991: 279-286 |
1990 |
1 | | Andy King,
Paul Soper:
Compile-Time Analysis of Concurrent Logic Programs for Multi-processors.
Dagstuhl Seminar on Parallelization in Inference Systems 1990: 367 |