School of Computing

Publications by Dr Andy King

Publication period   (7/1991 onwards)   -   ordered by publication type and date

Books

Journal Papers

Book Chapters

Conference Papers

  • Mutual Exclusion by Interpolation. Jael Kriener and Andy King. In Tom Schrijvers and Peter Thiemann, editors, Eleventh International Symposium on Functional and Logic Programming, Lecture Notes in Computer Science, page 16, Kobe, Japan, May 2012. Springer.
  • Existential Quantification as Incremental SAT. Jorg Brauer, Andy King, and Jael Kriener. In Ganesh Gopalakrishnan and Shaz Qadeer, editors, Twenty Third International Conference on Computer Aided Verification, Lecture Notes in Computer Science, page 16. Springer-Verlag, July 2011.
  • Approximate Quantifier Elimination for Propositional Boolean Formulae. Jorg Brauer and Andy King. In Mihaela Bobaru, Klaus Havelund, Gerard Holzmann, and Rajeev Joshi, editors, Third NASA Formal Methods Symposium, volume 6617 of Lecture Notes in Computer Science, pages 73-88. Springer-Verlag, April 2011.
  • Transfer Function Synthesis without Quantifier Elimination. Jorg Brauer and Andy King. In Gilles Barthe, editor, Twentieth European Symposium on Programming, volume 6602 of Lecture Notes in Computer Science, pages 97-115. Springer-Verlag, March 2011.
  • Range Analysis of Microcontroller Code Using Bit-Level Congruences. Jorg Brauer, Andy King, and Stefan Kowalewski. In Stefan Kowalewski and Marco Roveri, editors, Formal Methods for Industrial Critical Systems, volume 6371 of Lecture Notes in Computer Science, pages 82-98. Springer-Verlag, September 2010.
  • Automatic Abstraction for Intervals using Boolean Formulae. Jorg Brauer and Andy King. In Radhia Cousot and Matthieu Martel, editors, Seventeenth International Static Analysis Symposium, Lecture Notes in Computer Science. Springer-Verlag, September 2010.
  • A Pearl on SAT Solving in Prolog. Jacob M. Howe and Andy King. In Matthias Blume and German Vidal, editors, Tenth International Symposium on Functional and Logic Programming, Lecture Notes in Computer Science, page 10. Springer-Verlag, April 2010.
  • Automatic Abstraction for Congruences. Andy King and Harald Sondergaard. In Gilles Barthe and Manuel Hermenegildo, editors, Eleventh International Conference on Verification, Model Checking, and Abstract Interpretation, number 5944 in Lecture Notes in Computer Science, pages 197-213. Springer-Verlag, January 2010.
  • Logahedra: a New Weakly Relational Domain. Jacob M. Howe and Andy King. In Zhiming Lu and Anders P. Ravn, editors, International Symposium on Automated Technology for Verification and Analysis, Lecture Notes in Computer Science. Springer-Verlag, October 2009.
  • Integer Polyhedra for Program Analysis. Philip Charles, Jacob Howe, and Andy King. In Andrew Goldberg and Yunhong Zhou, editors, Proceedings of the Fifth International Conference on Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science. Springer-Verlag, June 2009.
  • Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry. Andy King. In Puri Arenas and Damiano Zanardini, editors, Proceedings on Logic-Based Methods in Programming Envrionments, pages 1-7, Udine, December 2008. Invited paper.
  • Inferring Congruence Equations using SAT. Andy King and Harald Sondergaard. In Aarti Gupta and Sharad Malik, editors, Twentieth International Conference on Computer-Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, July 2008.
  • Taming the Wrapping of Integer Arithmetic. Axel Simon and Andy King. In Gilberto File and Hanne Riis Nielson, editors, Fourteenth International Static Analysis Symposium, Lecture Notes in Computer Science. Springer, August 2007. To Appear, see http://www.springer.de/comp/lncs/index/html.
  • Widening Polyhedra with Landmarks. Axel Simon and Andy King. In Naoki Kobayashi, editor, Fourth Asian Symposium on Programming Languages and Systems, volume 4279 of Lecture Notes in Computer Science, pages 166-182. Springer Verlag, November 2006. See also http://www.springer.de/comp/lncs/index.html.
  • Detecting Determinacy in Prolog Programs. Andy King, Lunjin Lu, and Samir Genaim. In Sandro Etalle and Mirek Truszczynski, editors, Twenty Second International Conference on Logic Programming, volume 4079 of Lecture Notes in Computer Science, pages 132-147. Springer-Verlag, August 2006.
  • Collapsing Closures. Xuan Li, Andy King, and Lunjin Lu. In Sandro Etalle and Mirek Truszczynski, editors, Twenty Second International Conference on Logic Programming, volume 4079 of Lecture Notes in Computer Science, pages 148-162. Springer-Verlag, August 2006. Also see http://www.springer.de/comp/lncs/index.html.
  • Lazy Set-Sharing Analysis. Xuan Li, Andy King, and Lunjin Lu. In Philip Wadler and Masimi Hagiya, editors, Eighth International Symposium on Functional and Logic Programming, volume 3945 of Lecture Notes in Computer Science, pages 177-191. Springer-Verlag, April 2006. Also see http://www.springer.de/comp/lncs/index.html.
  • Widening ROBDDs with Prime Implicants. Neil Kettle, Andy King, and Tadeusz Strzemecki. In Holger Hermanns and Jens Palsberg, editors, Twelfth International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 3920 of Lecture Notes in Computer Science, pages 105-119. Springer-Verlag, March 2006. Also see http://www.springer.de/comp/lncs/index.html.
  • An Anytime Symmetry Detection Algorithm for ROBDDs. Neil Kettle and Andy King. In Hidetoshi Onodera, editor, Eleventh Asia and South Pacific Design Automation Conference, pages 243-248. IEEE, January 2006. Copyright held by IEEE 2006.
  • Exploiting Sparsity in Polyhedral Analysis. Axel Simon and Andy King. In Chris Hankin, editor, Twelfth International Static Analysis Symposium, volume 3672 of Lecture Notes in Computer Science, pages 336-351. Springer Verlag, September 2005. Also see http://www.springer.de/comp/lncs/index.html.
  • Determinacy Inference for Logic Programs. Lunjin Lu and Andy King. In Mooly Sagiv, editor, European Symposium on Programming, volume 3444, pages 108-123. Springer-Verlag, April 2005. Also see http://www.springer.de/comp/lncs/index.html.
  • Analysing Logic Programs by Reasoning Backwards. Jacob M. Howe, Andy King, and Lunjin Lu. In Maurice Bruynooghe and Kung-Kiu Lau, editors, Program Development in Computational Logic, volume 3049 of Lecture Notes in Computer Science, pages 152-188. Springer-Verlag, May 2004. Also see http://www.springer.de/comp/lncs/index.html.
  • On the Inference of Natural Level Mappings. Jonathan C. Martin and Andy King. In Maurice Bruynooghe and Kung-Kiu Lau, editors, Program Development in Computational Logic, volume 3049 of Lecture Notes in Computer Science, pages 432-452. Springer-Verlag, May 2004. Also see http://www.springer.de/comp/lncs/index.html.
  • Backward Pair Sharing Analysis. Lunjin Lu and Andy King. In Yukiyoshi Kameyama and Peter Stuckey, editors, Seventh International Symposium on Functional and Logic Programming, volume 2998 of Lecture Notes in Computer Science, pages 132-146. Springer-Verlag, April 2004. Also see http://www.springer.de/comp/lncs/index.html.
  • Forward versus Backward Verification of Logic Programs. Andy King and Lunjin Lu. In Catuscia Palamidessi, editor, International Conference on Logic Programming, volume 2916 of Lecture Notes in Computer Science, pages 315-330. Springer-Verlag, December 2003. Also see http://www.springer.de/comp/lncs/index.html.
  • Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. Samir Genaim and Andy King. In Pierpaolo Degano, editor, European Symposium on Programming, volume 2618 of Lecture Notes in Computer Science, pages 84-98. Springer-Verlag, April 2003. Also see http://www.springer.de/comp/lncs/index.html.
  • Two Variables per Linear Inequality as an Abstract Domain. Axel Simon, Andy King, and Jacob M. Howe. In M. Leuschel, editor, Proceedings of Logic Based Program Development and Transformation, volume 2664 of Lecture Notes in Computer Science, pages 71-89. Springer-Verlag, 2002. see http://www.springer.de./comp/lncs/index.html.
  • Backward Type Inference Generalises Type Checking. L. Lu and A. King. In M. Hermenegildo and G. Puebla, editors, Ninth International Static Analysis Symposium, volume 2477 of Lecture Notes in Computer Science, pages 85-101. Springer-Verlag, September 2002. Also see http://www.springer.de/comp/lncs/index.html.
  • Analyzing String Buffers in C. A. Simon and A. King. In H. Kirchner and C. Ringeissen, editors, International Conference on Algebraic Methodology and Software Technology, volume 2422 of Lecture Notes in Computer Science, pages 365-379. Springer, September 2002. Also see http://www.springer.de/comp/lncs/index.html.
  • Positive Boolean Functions as Multiheaded Clauses. J. M. Howe and A. King. In P Codognet, editor, International Conference on Logic Programming, Lecture Notes in Computer Science 2237, pages 120-134. Springer-Verlag, November 2001. see http://www.springer.de./comp/lncs/index.html.
  • Mode Analysis Domains for Typed Logic Programs. Jan-Georg Smaus, Pat Hill, and Andy King. In A Bossi, editor, Logic Programming, Synthesis and Transformation (Selected Papers), volume 1817 of Lecture Notes in Computer Science, pages 82-101, September 2000. Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.
  • Abstract Domains for Universal and Existential Properties. A. Heaton, P. Hill, and A. King. In G. Smolka, editor, European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 150-164. Springer-Verlag, March 2000. see http://www.springer.de./comp/lncs/index.html.
  • Implementing Groundness Analysis with Definite Boolean Functions. J. M. Howe and A. King. In G. Smolka, editor, European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 200-214. Springer-Verlag, March 2000. Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.
  • Specialising Finite Domain Programs using Polyhedra. J.M. Howe and A. King. In A. Bossi, editor, Logic Programming, Synthesis and Transformation (Selected Papers), volume 1817 of Lecture Notes in Computer Science, pages 118-135. Springer-Verlag, March 2000. Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.
  • Quotienting Share for Dependency Analysis. Andy King, Jan-Georg Smaus, and Pat Hill. In Doaitse Swierstra, editor, European Symposium on Programming, volume 1576 of Lecture Notes in Computer Science, pages 59-73. Springer-Verlag, April 1999. (c) Springer-Verlag, see also http://www.springer.de/comp/lncs/index.html.
  • Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations. Jan-Georg Smaus, Pat Hill, and Andy King. In P Flener, editor, Logic Programming, Synthesis and Transformation (Selected Papers), volume 1559 of Lecture Notes in Computer Science, pages 289-307. Springer-Verlag, March 1999. Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.
  • Analysis of Logic Programs with Delay. Andrew Heaton, Pat Hill, and Andy King. In N E Fuchs, editor, Logic Programming, Synthesis and Transformation (Selected Papers), volume 1463 of Lecture Notes in Computer Science, pages 148-167. Springer-Verlag, July 1998. Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.
  • Distance: a New Metric for Controlling Granularity for Parallel Execution. K. Shen, V. Santos Costa, and A. King. In Joint International Conference and Symposium on Logic Programming, pages 85-99. MIT Press, July 1998.
  • Termination of Logic Programs with block Declarations Running in Several Modes. Jan-Georg Smaus, Pat Hill, and Andy King. In Catuscia Palamidessi, editor, International Symposium on Programming Languages: Implementations, Logics and Programs, jointly held with Algebraic and Logic Programming, volume 1490 of Lecture Notes in Computer Science, pages 73-88. Springer-Verlag, see also http://www.springer.de/comp/lncs/index.html, June 1998.
  • Lower-bound time-complexity analysis of logic programs. Andy King, Kish Shen, and Florence Benoy. In Jan Maluszynski, editor, International Symposium on Logic Programming, pages 261 - 276. MIT Press, November 1997.
  • A new metric for controlling granularity for parallel execution. Kish Shen, Vitor Santos Costa, and Andy King. In Workshop on Parallelism and Implementation Technology for Constraint Logic Programming Languages, page 16, October 1997.
  • Inferring Argument Size Relationships with CLP(R). Florence Benoy and Andy King. In Logic Program Synthesis and Transformation, volume 1207 of Lecture Notes in Computer Science, pages 204-223. Springer-Verlag, August 1997.
  • Typed Norms for Typed Logic Programs. Jon Martin and Andy King. In J. Gallagher, editor, Logic Program Synthesis and Transformation, volume 1207 of Lecture Notes in Computer Science, pages 224-238. Springer-Verlag, August 1997.
  • Generating efficient, terminating logic programs. J.M. Martin and A.M. King. In Proceedings of the Seventh International Joint Conference on Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, pages 173-184. Springer Verlag, April 1997.
  • Continuation Compilation for Concurrent Logic Programming. B Kemp, A King, and P Soper. In A Crespo, editor, Proceedings of the Symposium on Artificial Intelligence in Real-time Control, pages 299-306. Pergamon, October 1994.
  • Depth-k Sharing and Freeness. A. King and P. Soper. In P. Van Hentenryck, editor, International Conference on Logic Programming, pages 553-568. MIT Press, January 1994.
  • A Synergistic Analysis for Sharing and Groundness which traces Linearity. Andy King. In D.Sannella, editor, European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 363-378. Springer-Verlag, January 1994.
  • Serialisation Analysis of Concurrent Logic Programs. A. King and P. Soper. In H. Kirchner, editor, Algebraic and Logic Programming, volume 632 of Lecture Notes in Computer Science, pages 322-334, September 1992.
  • Schedule Analysis of Concurrent Logic Programs. A. King and P. Soper. In K. Apt, editor, Joint International Conference and Symposium on Logic Programming, pages 478-492. MIT Press, January 1992.
  • Reducing Scheduling Overheads for Concurrent Logic Programs. A. King and P. Soper. In H. Boley and M. M. Richter, editors, Processing Declarative Knowledge, number 567 in Lecture Notes in Artificial Intelligence, pages 279-286. Springer-Verlag, July 1991.

Miscellaneous

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 08/02/2012 12:32