Andy King

According to our database1, Andy King authored at least 103 papers between 1990 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Backjumping is Exception Handling.
CoRR, 2020

Mind the Gap: Bit-vector Interpolation recast over Linear Integer Arithmetic.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

2019
Incremental Closure for Systems of Two Variables Per Inequality.
Theor. Comput. Sci., 2019

Incrementally closing octagons.
Formal Methods Syst. Des., 2019

2018
Preface: Functional and Logic Programming (FLOPS 2016).
Sci. Comput. Program., 2018

Closing the Performance Gap Between Doubles and Rationals for Octagons.
Proceedings of the Static Analysis - 25th International Symposium, 2018

2017
Optimising the Volgenant-Jonker algorithm for approximating graph edit distance.
Pattern Recognit. Lett., 2017

Partial evaluation of string obfuscations for Java malware detection.
Formal Aspects Comput., 2017

Theory learning with symmetry breaking.
Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

Compact Difference Bound Matrices.
Proceedings of the Programming Languages and Systems - 15th Asian Symposium, 2017

2016
Introduction to the 32nd International Conference on Logic Programming Special Issue.
Theory Pract. Log. Program., 2016

Papers presented at the 32nd International Conference on Logic Programming (ICLP 2016).
CoRR, 2016

From MinX to MinC: semantics-driven decompilation of recursive datatypes.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2015
Theory propagation and reification.
Sci. Comput. Program., 2015

Revisiting Volgenant-Jonker for Approximating Graph Edit Distance.
Proceedings of the Graph-Based Representations in Pattern Recognition, 2015

2014
Preface for SCP special issue on Principles and Practice of Declarative Programming.
Sci. Comput. Program., 2014

Partial Evaluation for Java Malware Detection.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

Semantics for Prolog with Cut - Revisited.
Proceedings of the Functional and Logic Programming - 12th International Symposium, 2014

Simple and Efficient Algorithms for Octagons.
Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013
Abstract interpretation of microcontroller code: Intervals meet congruences.
Sci. Comput. Program., 2013

Theory propagation and rational-trees.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

Proofs you can believe in: proving equivalences between Prolog semantics in Coq.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

BinSlayer: accurate comparison of binary executables.
Proceedings of the 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop 2013, 2013

2012
A pearl on SAT and SMT solving in Prolog.
Theor. Comput. Sci., 2012

Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051).
Dagstuhl Reports, 2012

Transfer Function Synthesis without Quantifier Elimination
Log. Methods Comput. Sci., 2012

Polyhedral Analysis Using Parametric Objectives.
Proceedings of the Static Analysis - 19th International Symposium, 2012

Loop Leaping with Closures.
Proceedings of the Static Analysis - 19th International Symposium, 2012

Range Analysis of Binaries with Minimal Effort.
Proceedings of the Formal Methods for Industrial Critical Systems, 2012

Mutual Exclusion by Interpolation.
Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

2011
RedAlert: Determinacy inference for Prolog.
Theory Pract. Log. Program., 2011

Approximate Quantifier Elimination for Propositional Boolean Formulae.
Proceedings of the NASA Formal Methods, 2011

Existential Quantification as Incremental SAT.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
The two variable per inequality abstract domain.
High. Order Symb. Comput., 2010

Quadtrees as an Abstract Domain.
Electron. Notes Theor. Comput. Sci., 2010

Range and Set Abstraction using SAT.
Electron. Notes Theor. Comput. Sci., 2010

Automatic Abstraction for Congruences.
Proceedings of the Verification, 2010

Automatic Abstraction for Intervals Using Boolean Formulae.
Proceedings of the Static Analysis - 17th International Symposium, 2010

Range Analysis of Microcontroller Code Using Bit-Level Congruences.
Proceedings of the Formal Methods for Industrial Critical Systems, 2010

A Pearl on SAT Solving in Prolog.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry
CoRR, 2009

Untangling Reverse Engineering with Logic and Abstraction.
Proceedings of the Logic Programming, 25th International Conference, 2009

Logahedra: A New Weakly Relational Domain.
Proceedings of the Automated Technology for Verification and Analysis, 2009

Integer Polyhedra for Program Analysis.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
Inferring non-suspension conditions for logic programs with dynamic scheduling.
ACM Trans. Comput. Log., 2008

An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2008

Inferring Congruence Equations Using SAT.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007
Taming the Wrapping of Integer Arithmetic.
Proceedings of the Static Analysis, 14th International Symposium, 2007

2006
Editorial.
High. Order Symb. Comput., 2006

Control Generation by Program Transformation.
Fundam. Informaticae, 2006

Widening ROBDDs with Prime Implicants.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

Collapsing Closures.
Proceedings of the Logic Programming, 22nd International Conference, 2006

Detecting Determinacy in Prolog Programs.
Proceedings of the Logic Programming, 22nd International Conference, 2006

Lazy Set-Sharing Analysis.
Proceedings of the Functional and Logic Programming, 8th International Symposium, 2006

An anytime symmetry detection algorithm for ROBDDs.
Proceedings of the 2006 Conference on Asia South Pacific Design Automation: ASP-DAC 2006, 2006

Widening Polyhedra with Landmarks.
Proceedings of the Programming Languages and Systems, 4th Asian Symposium, 2006

2005
Computing convex hulls with a linear solver.
Theory Pract. Log. Program., 2005

Exploiting Sparsity in Polyhedral Analysis.
Proceedings of the Static Analysis, 12th International Symposium, 2005

Determinacy Inference for Logic Programs.
Proceedings of the Programming Languages and Systems, 2005

2004
Convex hull of planar h-polyhedra.
Int. J. Comput. Math., 2004

On the Inference of Natural Level Mappings.
Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

Analysing Logic Programs by Reasoning Backwards.
Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

Backward Pair Sharing Analysis.
Proceedings of the Functional and Logic Programming, 7th International Symposium, 2004

2003
Three Optimisations for Sharing.
Theory Pract. Log. Program., 2003

Efficient Groundness Analysis in Prolog.
Theory Pract. Log. Program., 2003

Forward versus Backward Verification of Logic Programs.
Proceedings of the Logic Programming, 19th International Conference, 2003

Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling.
Proceedings of the Programming Languages and Systems, 2003

2002
A Backward Analysis for Constraint Logic Programs.
Theory Pract. Log. Program., 2002

Backward Type Inference Generalises Type Checking.
Proceedings of the Static Analysis, 9th International Symposium, 2002

Two Variables per Linear Inequality as an Abstract Domain.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

Analyzing String Buffers in C.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
Verifying Termination and Error-Freedom of Logic Programs with <tt>block</tt> Declarations.
Theory Pract. Log. Program., 2001

Positive Boolean Functions as Multiheaded Clauses.
Proceedings of the Logic Programming, 17th International Conference, 2001

2000
Pair-sharing over rational trees.
J. Log. Program., 2000

A simple polynomial groundness analysis for logic programs.
J. Log. Program., 2000

Abstracting numeric constraints with Boolean functions.
Inf. Process. Lett., 2000

Verifying Termination and Error-Freedom of Logic Programs with block Declarations
CoRR, 2000

Implementing Groundness Analysis with Definite Boolean Functions.
Proceedings of the Programming Languages and Systems, 2000

Abstract Domains for Universal and Existential Properties.
Proceedings of the Programming Languages and Systems, 2000

1999
Distance: A New Metric for Controlling Granularity for Parallel Execution.
J. Funct. Log. Program., 1999

Mode Analysis Domains for Typed Logic Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1999

Specialising Fininte Domain Programs Using Polyhedra.
Proceedings of the Logic Programming Synthesis and Transformation, 1999

Quotienting <i>Share</i> for Dependency Analysis.
Proceedings of the Programming Languages and Systems, 1999

Specialising Finite Domain Programs Using Polyhedra.
Proceedings of the Object-Oriented Technology, ECOOP'99 Workshop Reader, 1999

1998
Termination of Logic Programs with block Declarations Running in Several Modes.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations.
Proceedings of the Logic Programming Synthesis and Transformation, 1998

1997
Determinacy and determinacy analysis.
J. Program. Lang., 1997

Generating Efficient, Terminating Logic Programs.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Lower-bound Time-complexity Analysis of Logic Programs.
Proceedings of the Logic Programming, 1997

Analysis of Logic Programs with Delay.
Proceedings of the Logic Programming Synthesis and Transformation, 1997

Domain Construction for Mode Analysis of Typed Logic Programs.
Proceedings of the Logic Programming, 1997

1996
Typed Norms for Typed Logic Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1996

Inferring Argument Size Relationships with CLP(R).
Proceedings of the Logic Programming Synthesis and Transformation, 1996

1994
Depth-k Sharing and Freeness.
Proceedings of the Logic Programming, 1994

A Synergistic Analysis for Sharing and Groundness with Traces Linearity.
Proceedings of the Programming Languages and Systems, 1994

Continuation Compilation for Concurrent Logic Programming.
Proceedings of the Postprint Volume from the IFAC Symposium on Artificial Intelligence in Real-Time Control, 1994

1993
A Framework for Sharing Analysis.
Proceedings of the ICLP'93 Post Conference Workshop on: Concurrent, 1993

1992
Ordering Optimizations for Concurrent Logic Programs.
Proceedings of the Logical Foundations of Computer Science, 1992

Schedule Analysis of Concurrent Logic programs.
Proceedings of the Logic Programming, 1992

Serialisation Analysis of Concurrent Logic Programs.
Proceedings of the Algebraic and Logic Programming, 1992

1991
Reducing Scheduling Overheads for Concurrent Logic Programs.
Proceedings of the Processing Declarative Knowledge, 1991

1990
Compile-Time Analysis of Concurrent Logic Programs for Multi-processors.
Proceedings of the Parallelization in Inference Systems, 1990


  Loading...