BibSLEIGH — Andy

Travelled to:

1 × Austria
1 × Cyprus
1 × Denmark
1 × India
1 × Poland
1 × Sweden
1 × The Netherlands
2 × Belgium
2 × France
2 × Germany
4 × Italy
4 × Spain
5 × Japan
5 × USA
6 × United Kingdom

Collaborated with:

J.M.Howe L.Lu P.M.Hill J.Kriener P.Soper J.Smaus J.Brauer A.Simon J.C.Martin E.Robbins H.Søndergaard ∅ S.Genaim F.Benoy X.Li A.Heaton K.Shen R.Singh S.Blazy N.Kettle T.Strzemecki V.S.Costa T.Schrijvers S.Biallas S.Kowalewski

Talks about:

program (16) logic (15) analysi (14) infer (6) type (6) abstract (5) prolog (5) domain (5) share (5) use (5)

Person: Andy King

DBLP: King:Andy

Facilitated 4 volumes:

Contributed to:

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1994

1992

1997

2016

2017

Wrote 50 papers:

FLOPS-2014-KrienerK #prolog #revisited #semantics: Semantics for Prolog with Cut — Revisited (JK, AK), pp. 270–284.
LOPSTR-2014-SinghK #detection #java #partial evaluation: Partial Evaluation for Java Malware Detection (RS, AK), pp. 133–147.
PPDP-2013-KrienerKB #coq #prolog #proving #semantics: Proofs you can believe in: proving equivalences between Prolog semantics in Coq (JK, AK, SB), pp. 37–48.
PPDP-2013-RobbinsHK: Theory propagation and rational-trees (ER, JMH, AK), pp. 193–204.
FLOPS-2012-KrienerK: Mutual Exclusion by Interpolation (JK, AK), pp. 182–196.
SAS-2012-BiallasBKK: Loop Leaping with Closures (SB, JB, AK, SK), pp. 214–230.
SAS-2012-HoweK #analysis #parametricity #using: Polyhedral Analysis Using Parametric Objectives (JMH, AK), pp. 41–57.
CAV-2011-BrauerKK #incremental #quantifier #satisfiability: Existential Quantification as Incremental SAT (JB, AK, JK), pp. 191–207.
ESOP-2011-BrauerK #quantifier #synthesis: Transfer Function Synthesis without Quantifier Elimination (JB, AK), pp. 97–115.
ICLP-J-2011-KrienerK #named #prolog: RedAlert: Determinacy inference for Prolog (JK, AK), pp. 537–553.
FLOPS-2010-HoweK #prolog #satisfiability: A Pearl on SAT Solving in Prolog (JMH, AK), pp. 165–174.
SAS-2010-BrauerK #abstraction #automation #using: Automatic Abstraction for Intervals Using Boolean Formulae (JB, AK), pp. 167–183.
VMCAI-2010-KingS #abstraction #automation: Automatic Abstraction for Congruences (AK, HS), pp. 197–213.
ICLP-2009-King #abstraction #logic #reverse engineering: Untangling Reverse Engineering with Logic and Abstraction (AK), p. 37.
CAV-2008-KingS #congruence #equation #satisfiability #using: Inferring Congruence Equations Using SAT (AK, HS), pp. 281–293.
SAS-2007-SimonK #integer: Taming the Wrapping of Integer Arithmetic (AS, AK), pp. 121–136.
FLOPS-2006-LiKL #analysis #lazy evaluation: Lazy Set-Sharing Analysis (XL, AK, LL), pp. 177–191.
ICLP-2006-KingLG #detection #prolog #source code: Detecting Determinacy in Prolog Programs (AK, LL, SG), pp. 132–147.
ICLP-2006-LiKL: Collapsing Closures (XL, AK, LL), pp. 148–162.
TACAS-2006-KettleKS: Widening ROBDDs with Prime Implicants (NK, AK, TS), pp. 105–119.
ESOP-2005-LuK #logic programming #source code: Determinacy Inference for Logic Programs (LL, AK), pp. 108–123.
SAS-2005-SimonK #analysis: Exploiting Sparsity in Polyhedral Analysis (AS, AK), pp. 336–351.
FLOPS-2004-LuK #analysis: Backward Pair Sharing Analysis (LL, AK), pp. 132–146.
PDCL-2004-HoweKL #logic programming #reasoning #source code: Analysing Logic Programs by Reasoning Backwards (JMH, AK, LL), pp. 152–188.
PDCL-2004-MartinK #on the: On the Inference of Natural Level Mappings (JCM, AK), pp. 432–452.
ESOP-2003-GenaimK #analysis #independence #logic programming #scheduling #source code: Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling (SG, AK), pp. 84–98.
ICLP-2003-KingL #logic programming #source code #verification: Forward versus Backward Verification of Logic Programs (AK, LL), pp. 315–330.
LOPSTR-2002-SimonKH #abstract domain #difference #linear: Two Variables per Linear Inequality as an Abstract Domain (AS, AK, JMH), pp. 71–89.
SAS-2002-LuK #type checking #type inference: Backward Type Inference Generalises Type Checking (LL, AK), pp. 85–101.
ICLP-2001-HoweK #multi: Positive Boolean Functions as Multiheaded Clauses (JMH, AK), pp. 120–134.
ESOP-2000-HeatonHK #abstract domain: Abstract Domains for Universal and Existential Properties (AH, PMH, AK), pp. 150–164.
ESOP-2000-HoweK #analysis #implementation: Implementing Groundness Analysis with Definite Boolean Functions (JMH, AK), pp. 200–214.
ESOP-1999-KingSH #analysis #dependence: Quotienting Share for Dependency Analysis (AK, JGS, PMH), pp. 59–73.
LOPSTR-1999-HoweK #source code #using: Specialising Fininte Domain Programs Using Polyhedra (JMH, AK), pp. 118–135.
LOPSTR-1999-SmausHK #analysis #logic programming #source code: Mode Analysis Domains for Typed Logic Programs (JGS, PMH, AK), pp. 82–101.
ALP-PLILP-1998-SmausHK #logic programming #source code #termination: Termination of Logic Programs with block Declarations Running in Several Modes (JGS, PMH, AK), pp. 73–88.
JICSLP-1998-ShenCK #distance #execution #metric #named #parallel: Distance: A New Metric for Controlling Granularity for Parallel Execution (KS, VSC, AK), pp. 85–99.
LOPSTR-1998-SmausHK #fault #logic programming #multi #source code #using: Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations (JGS, PMH, AK), pp. 289–307.
ICLP-1997-SmausHK #analysis #logic programming #source code: Domain Construction for Mode Analysis of Typed Logic Programs (JGS, PMH, AK), p. 418.
ILPS-1997-KingSB #analysis #bound #logic programming #source code: Lower-bound Time-complexity Analysis of Logic Programs (AK, KS, FB), pp. 261–275.
LOPSTR-1997-HeatonHK #analysis #logic programming #source code: Analysis of Logic Programs with Delay (AH, PMH, AK), pp. 148–167.
LOPSTR-1996-BenoyK: Inferring Argument Size Relationships with CLP(R) (FB, AK), pp. 204–223.
LOPSTR-1996-MartinKS #logic programming #source code: Typed Norms for Typed Logic Programs (JCM, AK, PS), pp. 224–238.
ESOP-1994-King #analysis: A Synergistic Analysis for Sharing and Groundness with Traces Linearity (AK), pp. 363–378.
ICLP-1994-KingS: Depth-k Sharing and Freeness (AK, PS), pp. 553–568.
ALP-1992-KingS #analysis #concurrent #logic programming #source code: Serialisation Analysis of Concurrent Logic Programs (AK, PS), pp. 322–334.
JICSLP-1992-KingS #analysis #concurrent #logic programming #source code: Schedule Analysis of Concurrent Logic programs (AK, PS), pp. 478–492.
TAPSOFT-1997-MartinK #generative #logic programming #performance #source code: Generating Efficient, Terminating Logic Programs (JCM, AK), pp. 273–284.
POPL-2016-RobbinsKS #data type #decompiler #recursion #semantics: From MinX to MinC: semantics-driven decompilation of recursive datatypes (ER, AK, TS), pp. 191–203.
PPDP-2017-HoweRK #learning #symmetry: Theory learning with symmetry breaking (JMH, ER, AK), pp. 85–96.