default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndy King
Person information
- affiliation: University of Kent, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c74]Laura Bocchi
, Andy King, Maurizio Murgia:
Asynchronous Subtyping by Trace Relaxation. TACAS (1) 2024: 207-226- [i14]Jonah Pears, Laura Bocchi, Maurizio Murgia, Andy King:
Introducing TOAST: Safe Asynchronous Mixed-Choice For Timed Interactions. CoRR abs/2401.11197 (2024) - 2023
- [c73]Jonah Pears, Laura Bocchi, Andy King:
Safe Asynchronous Mixed-Choice for Timed Interactions. COORDINATION 2023: 214-231 - [c72]Thomas Seed, Chris Coppins, Andy King, Neil Evans:
Polynomial Analysis of Modular Arithmetic. SAS 2023: 508-539 - [i13]Jonah Pears, Laura Bocchi, Andy King:
Safe asynchronous mixed-choice for timed interactions. CoRR abs/2307.12688 (2023) - 2021
- [j29]Ed Robbins, Andy King, Jacob M. Howe:
Backjumping is Exception Handling. Theory Pract. Log. Program. 21(2): 125-144 (2021) - 2020
- [c71]Thomas Seed, Andy King, Neil Evans:
Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases. SAT 2020: 361-377 - [c70]Takamasa Okudono, Andy King:
Mind the Gap: Bit-vector Interpolation recast over Linear Integer Arithmetic. TACAS (1) 2020: 79-96 - [i12]Edward Robbins, Andy King, Jacob M. Howe:
Backjumping is Exception Handling. CoRR abs/2008.04720 (2020)
2010 – 2019
- 2019
- [j28]Aziem Chawdhary, Edward Robbins, Andy King:
Incrementally closing octagons. Formal Methods Syst. Des. 54(2): 232-277 (2019) - [j27]Jacob M. Howe, Andy King, Axel Simon:
Incremental Closure for Systems of Two Variables Per Inequality. Theor. Comput. Sci. 768: 1-42 (2019) - 2018
- [j26]Oleg Kiselyov, Andy King:
Preface: Functional and Logic Programming (FLOPS 2016). Sci. Comput. Program. 164: 1-2 (2018) - [c69]Aziem Chawdhary, Andy King:
Closing the Performance Gap Between Doubles and Rationals for Octagons. SAS 2018: 187-204 - 2017
- [j25]Aziem Chawdhary, Ranjeet Singh, Andy King:
Partial evaluation of string obfuscations for Java malware detection. Formal Aspects Comput. 29(1): 33-55 (2017) - [j24]William Jones, Aziem Chawdhary, Andy King:
Optimising the Volgenant-Jonker algorithm for approximating graph edit distance. Pattern Recognit. Lett. 87: 47-54 (2017) - [c68]Aziem Chawdhary, Andy King:
Compact Difference Bound Matrices. APLAS 2017: 471-490 - [c67]Jacob M. Howe, Edward Robbins, Andy King:
Theory learning with symmetry breaking. PPDP 2017: 85-96 - 2016
- [j23]Manuel Carro, Andy King:
Introduction to the 32nd International Conference on Logic Programming Special Issue. Theory Pract. Log. Program. 16(5-6): 509-514 (2016) - [c66]Edward Robbins, Andy King, Tom Schrijvers:
From MinX to MinC: semantics-driven decompilation of recursive datatypes. POPL 2016: 191-203 - [e5]Oleg Kiselyov, Andy King:
Functional and Logic Programming - 13th International Symposium, FLOPS 2016, Kochi, Japan, March 4-6, 2016, Proceedings. Lecture Notes in Computer Science 9613, Springer 2016, ISBN 978-3-319-29603-6 [contents] - [e4]Manuel Carro, Andy King, Neda Saeedloei, Marina De Vos:
Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016 TCs, October 16-21, 2016, New York City, USA. OASIcs 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-007-1 [contents] - [i11]Manuel Carro, Andy King:
Papers presented at the 32nd International Conference on Logic Programming (ICLP 2016). CoRR abs/1608.05440 (2016) - [i10]Aziem Chawdhary, Edward Robbins, Andy King:
Incrementally Closing Octagons. CoRR abs/1610.02952 (2016) - 2015
- [j22]Edward Robbins, Jacob M. Howe, Andy King:
Theory propagation and reification. Sci. Comput. Program. 111: 3-22 (2015) - [c65]William Jones, Aziem Chawdhary, Andy King:
Revisiting Volgenant-Jonker for Approximating Graph Edit Distance. GbRPR 2015: 98-107 - 2014
- [j21]Andy King:
Preface for SCP special issue on Principles and Practice of Declarative Programming. Sci. Comput. Program. 84: 1-2 (2014) - [c64]Aziem Chawdhary, Edward Robbins, Andy King:
Simple and Efficient Algorithms for Octagons. APLAS 2014: 296-313 - [c63]Jael Kriener, Andy King:
Semantics for Prolog with Cut - Revisited. FLOPS 2014: 270-284 - [c62]Ranjeet Singh, Andy King:
Partial Evaluation for Java Malware Detection. LOPSTR 2014: 133-147 - [e3]Olaf Chitil, Andy King, Olivier Danvy:
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, Kent, Canterbury, United Kingdom, September 8-10, 2014. ACM 2014, ISBN 978-1-4503-2947-7 [contents] - 2013
- [j20]Jörg Brauer, Andy King, Stefan Kowalewski:
Abstract interpretation of microcontroller code: Intervals meet congruences. Sci. Comput. Program. 78(7): 862-883 (2013) - [c61]Martial Bourquin, Andy King, Edward Robbins:
BinSlayer: accurate comparison of binary executables. PPREW@POPL 2013: 4:1-4:10 - [c60]Jael Kriener, Andy King, Sandrine Blazy:
Proofs you can believe in: proving equivalences between Prolog semantics in Coq. PPDP 2013: 37-48 - [c59]Edward Robbins, Jacob M. Howe, Andy King:
Theory propagation and rational-trees. PPDP 2013: 193-204 - 2012
- [j19]Jörg Brauer, Andy King:
Transfer Function Synthesis without Quantifier Elimination. Log. Methods Comput. Sci. 8(3) (2012) - [j18]Jacob M. Howe, Andy King:
A pearl on SAT and SMT solving in Prolog. Theor. Comput. Sci. 435: 43-55 (2012) - [c58]Jael Kriener, Andy King:
Mutual Exclusion by Interpolation. FLOPS 2012: 182-196 - [c57]Edd Barrett, Andy King:
Range Analysis of Binaries with Minimal Effort. FMICS 2012: 93-107 - [c56]Jacob M. Howe, Andy King:
Polyhedral Analysis Using Parametric Objectives. SAS 2012: 41-57 - [c55]Sebastian Biallas, Jörg Brauer, Andy King, Stefan Kowalewski:
Loop Leaping with Closures. SAS 2012: 214-230 - [e2]Danny De Schreye, Gerda Janssens, Andy King:
Principles and Practice of Declarative Programming, PPDP'12, Leuven, Belgium - September 19 - 21, 2012. ACM 2012, ISBN 978-1-4503-1522-7 [contents] - [i9]Andy King, Alan Mycroft, Thomas W. Reps, Axel Simon:
Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051). Dagstuhl Reports 2(1): 100-116 (2012) - 2011
- [j17]Jael Kriener, Andy King:
RedAlert: Determinacy inference for Prolog. Theory Pract. Log. Program. 11(4-5): 537-553 (2011) - [c54]Jörg Brauer, Andy King, Jael Kriener:
Existential Quantification as Incremental SAT. CAV 2011: 191-207 - [c53]Jörg Brauer, Andy King:
Transfer Function Synthesis without Quantifier Elimination. ESOP 2011: 97-115 - [c52]Jörg Brauer, Andy King:
Approximate Quantifier Elimination for Propositional Boolean Formulae. NASA Formal Methods 2011: 73-88 - [i8]Jael Kriener, Andy King:
RedAlert: Determinacy Inference for Prolog. CoRR abs/1109.2548 (2011) - 2010
- [j16]Axel Simon, Andy King:
The two variable per inequality abstract domain. High. Order Symb. Comput. 23(1): 87-143 (2010) - [c51]Jacob M. Howe, Andy King:
A Pearl on SAT Solving in Prolog. FLOPS 2010: 165-174 - [c50]Jörg Brauer, Andy King, Stefan Kowalewski:
Range Analysis of Microcontroller Code Using Bit-Level Congruences. FMICS 2010: 82-98 - [c49]Jörg Brauer, Andy King:
Automatic Abstraction for Intervals Using Boolean Formulae. SAS 2010: 167-183 - [c48]Andy King, Harald Søndergaard:
Automatic Abstraction for Congruences. VMCAI 2010: 197-213 - [c47]Edd Barrett, Andy King:
Range and Set Abstraction using SAT. NSAD@SAS 2010: 17-27 - [c46]Jacob M. Howe, Andy King, Charles Lawrence-Jones:
Quadtrees as an Abstract Domain. NSAD@SAS 2010: 89-100
2000 – 2009
- 2009
- [c45]Philip J. Charles, Jacob M. Howe, Andy King:
Integer Polyhedra for Program Analysis. AAIM 2009: 85-99 - [c44]Jacob M. Howe, Andy King:
Logahedra: A New Weakly Relational Domain. ATVA 2009: 306-320 - [c43]Andy King:
Untangling Reverse Engineering with Logic and Abstraction. ICLP 2009: 37 - [i7]Andy King:
Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry. CoRR abs/0903.2353 (2009) - 2008
- [j15]Neil Kettle, Andy King:
An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(4): 764-777 (2008) - [j14]Samir Genaim, Andy King:
Inferring non-suspension conditions for logic programs with dynamic scheduling. ACM Trans. Comput. Log. 9(3): 17:1-17:43 (2008) - [c42]Andy King, Harald Søndergaard:
Inferring Congruence Equations Using SAT. CAV 2008: 281-293 - [e1]Andy King:
Logic-Based Program Synthesis and Transformation, 17th International Symposium, LOPSTR 2007, Kongens Lyngby, Denmark, August 23-24, 2007, Revised Selected Papers. Lecture Notes in Computer Science 4915, Springer 2008, ISBN 978-3-540-78768-6 [contents] - 2007
- [c41]Axel Simon, Andy King:
Taming the Wrapping of Integer Arithmetic. SAS 2007: 121-136 - 2006
- [j13]Andy King, Jonathan C. Martin:
Control Generation by Program Transformation. Fundam. Informaticae 69(1-2): 179-218 (2006) - [j12]Olivier Danvy, Andrzej Filinski, Jean-Louis Giavitto, Andy King, Pierre-Etienne Moreau, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 19(4): 343-344 (2006) - [c40]Axel Simon, Andy King:
Widening Polyhedra with Landmarks. APLAS 2006: 166-182 - [c39]Neil Kettle, Andy King:
An anytime symmetry detection algorithm for ROBDDs. ASP-DAC 2006: 243-248 - [c38]Xuan Li, Andy King, Lunjin Lu:
Lazy Set-Sharing Analysis. FLOPS 2006: 177-191 - [c37]Andy King, Lunjin Lu, Samir Genaim:
Detecting Determinacy in Prolog Programs. ICLP 2006: 132-147 - [c36]Xuan Li, Andy King, Lunjin Lu:
Collapsing Closures. ICLP 2006: 148-162 - [c35]Neil Kettle, Andy King, Tadeusz Strzemecki:
Widening ROBDDs with Prime Implicants. TACAS 2006: 105-119 - 2005
- [j11]Florence Benoy, Andy King, Frédéric Mesnard:
Computing convex hulls with a linear solver. Theory Pract. Log. Program. 5(1-2): 259-271 (2005) - [c34]Lunjin Lu, Andy King:
Determinacy Inference for Logic Programs. ESOP 2005: 108-123 - [c33]Axel Simon, Andy King:
Exploiting Sparsity in Polyhedral Analysis. SAS 2005: 336-351 - 2004
- [j10]Axel Simon, Andy King:
Convex hull of planar h-polyhedra. Int. J. Comput. Math. 81(3): 259-271 (2004) - [c32]Lunjin Lu, Andy King:
Backward Pair Sharing Analysis. FLOPS 2004: 132-146 - [p2]Jacob M. Howe, Andy King, Lunjin Lu:
Analysing Logic Programs by Reasoning Backwards. Program Development in Computational Logic 2004: 152-188 - [p1]Jonathan C. Martin, Andy King:
On the Inference of Natural Level Mappings. Program Development in Computational Logic 2004: 432-452 - [i6]Axel Simon, Andy King:
Convex Hull of Planar H-Polyhedra. CoRR cs.CG/0405089 (2004) - 2003
- [j9]Jacob M. Howe, Andy King:
Efficient Groundness Analysis in Prolog. Theory Pract. Log. Program. 3(1): 95-124 (2003) - [j8]Jacob M. Howe, Andy King:
Three Optimisations for Sharing. Theory Pract. Log. Program. 3(2): 243-257 (2003) - [c31]Samir Genaim, Andy King:
Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. ESOP 2003: 84-98 - [c30]Andy King, Lunjin Lu:
Forward versus Backward Verification of Logic Programs. ICLP 2003: 315-330 - [i5]Florence Benoy, Andy King, Frédéric Mesnard:
Computing Convex Hulls with a Linear Solver. CoRR cs.PL/0311002 (2003) - 2002
- [j7]Andy King, Lunjin Lu:
A Backward Analysis for Constraint Logic Programs. Theory Pract. Log. Program. 2(4-5): 517-547 (2002) - [c29]Axel Simon, Andy King:
Analyzing String Buffers in C. AMAST 2002: 365-379 - [c28]Axel Simon, Andy King, Jacob M. Howe:
Two Variables per Linear Inequality as an Abstract Domain. LOPSTR 2002: 71-89 - [c27]Lunjin Lu, Andy King:
Backward Type Inference Generalises Type Checking. SAS 2002: 85-101 - [i4]Andy King, Lunjin Lu:
A Backward Analysis for Constraint Logic Programs. CoRR cs.PL/0201011 (2002) - [i3]Jacob M. Howe, Andy King:
Efficient Groundness Analysis in Prolog. CoRR cs.PL/0201012 (2002) - [i2]Jacob M. Howe, Andy King:
Three Optimisations for Sharing. CoRR cs.PL/0203022 (2002) - 2001
- [j6]Jan-Georg Smaus, Patricia M. Hill, Andy King:
Verifying Termination and Error-Freedom of Logic Programs with block Declarations. Theory Pract. Log. Program. 1(4): 447-486 (2001) - [c26]Jacob M. Howe, Andy King:
Positive Boolean Functions as Multiheaded Clauses. ICLP 2001: 120-134 - 2000
- [j5]Jacob M. Howe, Andy King:
Abstracting numeric constraints with Boolean functions. Inf. Process. Lett. 75(1-2): 17-23 (2000) - [j4]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) - [j3]Andy King:
Pair-sharing over rational trees. J. Log. Program. 46(1-2): 139-155 (2000) - [c25]Andrew Heaton, Patricia M. Hill, Andy King:
Abstract Domains for Universal and Existential Properties. ESOP 2000: 150-164 - [c24]Jacob M. Howe, Andy King:
Implementing Groundness Analysis with Definite Boolean Functions. ESOP 2000: 200-214 - [i1]Jan-Georg Smaus, Patricia M. Hill, Andy King:
Verifying Termination and Error-Freedom of Logic Programs with block Declarations. CoRR cs.LO/0006033 (2000)
1990 – 1999
- 1999
- [j2]Kish Shen, Vítor Santos Costa, Andy King:
Distance: A New Metric for Controlling Granularity for Parallel Execution. J. Funct. Log. Program. 1999(Special Issue 1) (1999) - [c23]Jacob M. Howe, Andy King:
Specialising Finite Domain Programs Using Polyhedra. ECOOP Workshops 1999: 258-259 - [c22]Andy King, Jan-Georg Smaus, Patricia M. Hill:
Quotienting Share for Dependency Analysis. ESOP 1999: 59-73 - [c21]Jan-Georg Smaus, Patricia M. Hill, Andy King:
Mode Analysis Domains for Typed Logic Programs. LOPSTR 1999: 82-101 - [c20]Jacob M. Howe, Andy King:
Specialising Fininte Domain Programs Using Polyhedra. LOPSTR 1999: 118-135 - 1998
- [c19]Kish Shen, Vítor Santos Costa, Andy King:
Distance: A New Metric for Controlling Granularity for Parallel Execution. IJCSLP 1998: 85-99 - [c18]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 - [c17]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
- [j1]Patricia M. Hill, Andy King:
Determinacy and determinacy analysis. J. Program. Lang. 5(1): 135-171 (1997) - [c16]Jan-Georg Smaus, Patricia M. Hill, Andy King:
Domain Construction for Mode Analysis of Typed Logic Programs. ICLP 1997: 418 - [c15]Andrew Heaton, Patricia M. Hill, Andy King:
Analysis of Logic Programs with Delay. LOPSTR 1997: 148-167 - [c14]Andy King, Kish Shen, Florence Benoy:
Lower-bound Time-complexity Analysis of Logic Programs. ILPS 1997: 261-275 - [c13]Jonathan C. Martin, Andy King:
Generating Efficient, Terminating Logic Programs. TAPSOFT 1997: 273-284 - 1996
- [c12]Florence Benoy, Andy King:
Inferring Argument Size Relationships with CLP(R). LOPSTR 1996: 204-223 - [c11]Jonathan C. Martin, Andy King, Paul Soper:
Typed Norms for Typed Logic Programs. LOPSTR 1996: 224-238 - 1994
- [c10]B. Kemp, Paul Soper, Andy King:
Continuation Compilation for Concurrent Logic Programming. AIRTC 1994: 299-305 - [c9]Andy King:
A Synergistic Analysis for Sharing and Groundness with Traces Linearity. ESOP 1994: 363-378 - [c8]Andy King, Paul Soper:
Depth-k Sharing and Freeness. ICLP 1994: 553-568 - 1993
- [c7]Andy King:
A Framework for Sharing Analysis. ICLP Workshop on Concurrent, Distributed & Parallel Implementations of Logic Programming Systems 1993: 5-23 - [c6]Andy King:
A Framework for Sharing Analysis. ICLP-Workshops on Implementation of Logic Programming Systems 1993: 137-149 - 1992
- [c5]Andy King, Paul Soper:
Serialisation Analysis of Concurrent Logic Programs. ALP 1992: 322-334 - [c4]Andy King, Paul Soper:
Schedule Analysis of Concurrent Logic programs. JICSLP 1992: 478-492 - [c3]Andy King, Paul Soper:
Ordering Optimizations for Concurrent Logic Programs. LFCS 1992: 221-228 - 1991
- [c2]Andy King, Paul Soper:
Reducing Scheduling Overheads for Concurrent Logic Programs. PDK 1991: 279-286 - 1990
- [c1]Andy King, Paul Soper:
Compile-Time Analysis of Concurrent Logic Programs for Multi-processors. Dagstuhl Seminar on Parallelization in Inference Systems 1990: 367
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
