Compile-Time Analysis of Concurrent Logic Programs for Multi-processors. - Andy King; Paul Soper (Dagstuhl Seminar on Parallelization in Inference Systems, 1990)

Reducing Scheduling Overheads for Concurrent Logic Programs. - Andy King; Paul Soper (PDK, 1991)

Serialisation Analysis of Concurrent Logic Programs. - Andy King; Paul Soper (ALP, 1992)

Schedule Analysis of Concurrent Logic programs. - Andy King; Paul Soper (JICSLP, 1992)

Ordering Optimizations for Concurrent Logic Programs. - Andy King; Paul Soper (LFCS, 1992)

A Framework for Sharing Analysis. - Andy King (ICLP-Workshops on Implementation of Logic Programming Systems, 1993)

Continuation Compilation for Concurrent Logic Programming. - B. Kemp; Paul Soper; Andy King (AIRTC, 1994)

A Synergistic Analysis for Sharing and Groundness with Traces Linearity. - Andy King (ESOP, 1994)

Depth-k Sharing and Freeness. - Andy King; Paul Soper (ICLP, 1994)

Inferring Argument Size Relationships with CLP(R). - Florence Benoy; Andy King (LOPSTR, 1996)

Typed Norms for Typed Logic Programs. - Jonathan C. Martin; Andy King; Paul Soper (LOPSTR, 1996)

Domain Construction for Mode Analysis of Typed Logic Programs. - Jan-Georg Smaus; Patricia M. Hill; Andy King (ICLP, 1997)

Analysis of Logic Programs with Delay. - Andrew Heaton; Patricia M. Hill; Andy King (LOPSTR, 1997)

Lower-bound Time-complexity Analysis of Logic Programs. - Andy King; Kish Shen; Florence Benoy (ILPS, 1997)

Generating Efficient, Terminating Logic Programs. - Jonathan C. Martin; Andy King (TAPSOFT, 1997)

Determinacy and determinacy analysis. - Patricia M. Hill; Andy King (J. Program. Lang., 1997)

Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations. - Jan-Georg Smaus; Patricia M. Hill; Andy King (LOPSTR, 1998)

Termination of Logic Programs with block Declarations Running in Several Modes. - Jan-Georg Smaus; Patricia M. Hill; Andy King (PLILP/ALP, 1998)

Specialising Finite Domain Programs Using Polyhedra. - Jacob M. Howe; Andy King (ECOOP Workshops, 1999)

Quotienting Share for Dependency Analysis. - Andy King; Jan-Georg Smaus; Patricia M. Hill (ESOP, 1999)

Specialising Fininte Domain Programs Using Polyhedra. - Jacob M. Howe; Andy King (LOPSTR, 1999)

Mode Analysis Domains for Typed Logic Programs. - Jan-Georg Smaus; Patricia M. Hill; Andy King (LOPSTR, 1999)

Distance: A New Metric for Controlling Granularity for Parallel Execution. - Kish Shen; Vítor Santos Costa; Andy King (J. Funct. Log. Program., 1999)

Abstract Domains for Universal and Existential Properties. - Andrew Heaton; Patricia M. Hill; Andy King (ESOP, 2000)

Implementing Groundness Analysis with Definite Boolean Functions. - Jacob M. Howe; Andy King (ESOP, 2000)

Verifying Termination and Error-Freedom of Logic Programs with block Declarations - Jan-Georg Smaus; Patricia M. Hill; Andy King (CoRR, 2000)

Abstracting numeric constraints with Boolean functions. - Jacob M. Howe; Andy King (Inf. Process. Lett., 2000)

A simple polynomial groundness analysis for logic programs. - Andy Heaton; Muhamed Abo-Zaed; Michael Codish; Andy King (J. Log. Program., 2000)

Pair-sharing over rational trees. - Andy King (J. Log. Program., 2000)

Positive Boolean Functions as Multiheaded Clauses. - Jacob M. Howe; Andy King (ICLP, 2001)

Verifying Termination and Error-Freedom of Logic Programs with block Declarations. - Jan-Georg Smaus; Patricia M. Hill; Andy King (Theory Pract. Log. Program., 2001)

Analyzing String Buffers in C. - Axel Simon; Andy King (AMAST, 2002)

Two Variables per Linear Inequality as an Abstract Domain. - Axel Simon; Andy King; Jacob M. Howe (LOPSTR, 2002)

Backward Type Inference Generalises Type Checking. - Lunjin Lu; Andy King (SAS, 2002)

A Backward Analysis for Constraint Logic Programs. - Andy King; Lunjin Lu (Theory Pract. Log. Program., 2002)

Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. - Samir Genaim; Andy King (ESOP, 2003)

Forward versus Backward Verification of Logic Programs. - Andy King; Lunjin Lu (ICLP, 2003)

Efficient Groundness Analysis in Prolog. - Jacob M. Howe; Andy King (Theory Pract. Log. Program., 2003)

Three Optimisations for Sharing. - Jacob M. Howe; Andy King (Theory Pract. Log. Program., 2003)

Backward Pair Sharing Analysis. - Lunjin Lu; Andy King (FLOPS, 2004)

Analysing Logic Programs by Reasoning Backwards. - Jacob M. Howe; Andy King; Lunjin Lu (Program Development in Computational Logic, 2004)

On the Inference of Natural Level Mappings. - Jonathan C. Martin; Andy King (Program Development in Computational Logic, 2004)

Convex hull of planar h-polyhedra. - Axel Simon; Andy King (Int. J. Comput. Math., 2004)

Determinacy Inference for Logic Programs. - Lunjin Lu; Andy King (ESOP, 2005)

Exploiting Sparsity in Polyhedral Analysis. - Axel Simon; Andy King (SAS, 2005)

Computing convex hulls with a linear solver. - Florence Benoy; Andy King; Frédéric Mesnard (Theory Pract. Log. Program., 2005)

Widening Polyhedra with Landmarks. - Axel Simon; Andy King (APLAS, 2006)

An anytime symmetry detection algorithm for ROBDDs. - Neil Kettle; Andy King (ASP-DAC, 2006)

Lazy Set-Sharing Analysis. - Xuan Li; Andy King; Lunjin Lu (FLOPS, 2006)

Detecting Determinacy in Prolog Programs. - Andy King; Lunjin Lu; Samir Genaim (ICLP, 2006)

Collapsing Closures. - Xuan Li; Andy King; Lunjin Lu (ICLP, 2006)

Widening ROBDDs with Prime Implicants. - Neil Kettle; Andy King; Tadeusz Strzemecki (TACAS, 2006)

Control Generation by Program Transformation. - Andy King; Jonathan C. Martin (Fundam. Informaticae, 2006)

Editorial. - Olivier Danvy; Andrzej Filinski; Jean-Louis Giavitto; Andy King; Pierre-Etienne Moreau; Carolyn L. Talcott (High. Order Symb. Comput., 2006)

Taming the Wrapping of Integer Arithmetic. - Axel Simon; Andy King (SAS, 2007)

Inferring Congruence Equations Using SAT. - Andy King; Harald Søndergaard (CAV, 2008)

An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs. - Neil Kettle; Andy King (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2008)

Inferring non-suspension conditions for logic programs with dynamic scheduling. - Samir Genaim; Andy King (ACM Trans. Comput. Log., 2008)

Integer Polyhedra for Program Analysis. - Philip J. Charles; Jacob M. Howe; Andy King (AAIM, 2009)

Logahedra: A New Weakly Relational Domain. - Jacob M. Howe; Andy King (ATVA, 2009)

Untangling Reverse Engineering with Logic and Abstraction. - Andy King (ICLP, 2009)

Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry - Andy King (CoRR, 2009)

A Pearl on SAT Solving in Prolog. - Jacob M. Howe; Andy King (FLOPS, 2010)

Range Analysis of Microcontroller Code Using Bit-Level Congruences. - Jörg Brauer; Andy King; Stefan Kowalewski (FMICS, 2010)

Automatic Abstraction for Intervals Using Boolean Formulae. - Jörg Brauer; Andy King (SAS, 2010)

Automatic Abstraction for Congruences. - Andy King; Harald Søndergaard (VMCAI, 2010)

Range and Set Abstraction using SAT. - Edd Barrett; Andy King (NSAD@SAS, 2010)

Quadtrees as an Abstract Domain. - Jacob M. Howe; Andy King; Charles Lawrence-Jones (NSAD@SAS, 2010)

The two variable per inequality abstract domain. - Axel Simon; Andy King (High. Order Symb. Comput., 2010)

Existential Quantification as Incremental SAT. - Jörg Brauer; Andy King; Jael Kriener (CAV, 2011)

Approximate Quantifier Elimination for Propositional Boolean Formulae. - Jörg Brauer; Andy King (NASA Formal Methods, 2011)

RedAlert: Determinacy inference for Prolog. - Jael Kriener; Andy King (Theory Pract. Log. Program., 2011)

Mutual Exclusion by Interpolation. - Jael Kriener; Andy King (FLOPS, 2012)

Range Analysis of Binaries with Minimal Effort. - Edd Barrett; Andy King (FMICS, 2012)

Loop Leaping with Closures. - Sebastian Biallas; Jörg Brauer; Andy King; Stefan Kowalewski (SAS, 2012)

Polyhedral Analysis Using Parametric Objectives. - Jacob M. Howe; Andy King (SAS, 2012)

Transfer Function Synthesis without Quantifier Elimination - Jörg Brauer; Andy King (Log. Methods Comput. Sci., 2012)

Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051). - Andy King; Alan Mycroft; Thomas W. Reps; Axel Simon (Dagstuhl Reports, 2012)

A pearl on SAT and SMT solving in Prolog. - Jacob M. Howe; Andy King (Theor. Comput. Sci., 2012)

BinSlayer: accurate comparison of binary executables. - Martial Bourquin; Andy King; Edward Robbins 001 (PPREW@POPL, 2013)

Proofs you can believe in: proving equivalences between Prolog semantics in Coq. - Jael Kriener; Andy King; Sandrine Blazy (PPDP, 2013)

Theory propagation and rational-trees. - Edward Robbins 001; Jacob M. Howe; Andy King (PPDP, 2013)

Abstract interpretation of microcontroller code: Intervals meet congruences. - Jörg Brauer; Andy King; Stefan Kowalewski (Sci. Comput. Program., 2013)

Simple and Efficient Algorithms for Octagons. - Aziem Chawdhary; Edward Robbins 001; Andy King (APLAS, 2014)

Semantics for Prolog with Cut - Revisited. - Jael Kriener; Andy King (FLOPS, 2014)

Partial Evaluation for Java Malware Detection. - Ranjeet Singh; Andy King (LOPSTR, 2014)

Preface for SCP special issue on Principles and Practice of Declarative Programming. - Andy King (Sci. Comput. Program., 2014)

Revisiting Volgenant-Jonker for Approximating Graph Edit Distance. - William Jones; Aziem Chawdhary; Andy King (GbRPR, 2015)

Theory propagation and reification. - Edward Robbins 001; Jacob M. Howe; Andy King (Sci. Comput. Program., 2015)

From MinX to MinC: semantics-driven decompilation of recursive datatypes. - Edward Robbins 001; Andy King; Tom Schrijvers (POPL, 2016)

Papers presented at the 32nd International Conference on Logic Programming (ICLP 2016). - Manuel Carro; Andy King (CoRR, 2016)

Introduction to the 32nd International Conference on Logic Programming Special Issue. - Manuel Carro; Andy King (Theory Pract. Log. Program., 2016)

Compact Difference Bound Matrices. - Aziem Chawdhary; Andy King (APLAS, 2017)

Theory learning with symmetry breaking. - Jacob M. Howe; Edward Robbins 001; Andy King (PPDP, 2017)

Partial evaluation of string obfuscations for Java malware detection. - Aziem Chawdhary; Ranjeet Singh; Andy King (Formal Aspects Comput., 2017)

Optimising the Volgenant-Jonker algorithm for approximating graph edit distance. - William Jones; Aziem Chawdhary; Andy King (Pattern Recognit. Lett., 2017)

Closing the Performance Gap Between Doubles and Rationals for Octagons. - Aziem Chawdhary; Andy King (SAS, 2018)

Preface: Functional and Logic Programming (FLOPS 2016). - Oleg Kiselyov; Andy King (Sci. Comput. Program., 2018)

Incrementally closing octagons. - Aziem Chawdhary; Edward Robbins 001; Andy King (Formal Methods Syst. Des., 2019)

Incremental Closure for Systems of Two Variables Per Inequality. - Jacob M. Howe; Andy King; Axel Simon (Theor. Comput. Sci., 2019)

Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases. - Thomas Seed; Andy King; Neil Evans (SAT, 2020)

Mind the Gap: Bit-vector Interpolation recast over Linear Integer Arithmetic. - Takamasa Okudono; Andy King (TACAS (1), 2020)

Backjumping is Exception Handling. - Ed Robbins 001; Andy King; Jacob M. Howe (Theory Pract. Log. Program., 2021)

Safe Asynchronous Mixed-Choice for Timed Interactions. - Jonah Pears; Laura Bocchi; Andy King (COORDINATION, 2023)

Polynomial Analysis of Modular Arithmetic. - Thomas Seed; Chris Coppins; Andy King; Neil Evans (SAS, 2023)

Asynchronous Subtyping by Trace Relaxation. - Laura Bocchi; Andy King; Maurizio Murgia 001 (TACAS (1), 2024)

Introducing TOAST: Safe Asynchronous Mixed-Choice For Timed Interactions. - Jonah Pears; Laura Bocchi; Maurizio Murgia 001; Andy King (CoRR, 2024)

Abstract Subtyping for Asynchronous Multiparty Sessions. - Laura Bocchi; Andy King; Maurizio Murgia 001; Simon Thompson 001 (CONCUR, 2025)

Timeout Asynchronous Session Types: Safe Asynchronous Mixed-Choice For Timed Interactions. - Jonah Pears; Laura Bocchi; Maurizio Murgia 001; Andy King (Log. Methods Comput. Sci., 2025)