School of Computing

Publications by Prof Andy King

Also view these in the Kent Academic Repository

Article
Chawdhary, A., King, A. and Singh, R. (2017). Partial Evaluation of String Obfuscations for Java Malware Detection. Formal Aspects of Computing 29.
Jones, W., Chawdhary, A. and King, A. (2016). Optimising the Volgenant-Jonker Algorithm for Approximating Graph Edit Distance. Pattern Recognition Letters [Online]:1-9. Available at: http://dx.doi.org/10.1016/j.patrec.2016.07.024.
Robbins, E., Howe, J. and King, A. (2015). Theory Propagation and Reification. Science of Computer Programming [Online] 111:3-22. Available at: http://dx.doi.org/10.1016/j.scico.2014.05.013.
Kriener, J., King, A. and Blazy, S. (2014). Proofs You Can Believe In: Proving Equivalences Between Prolog Semantics in Coq (long version). Science of Computer Programming.
Brauer, J., King, A. and Kowalewski, S. (2013). Abstract Interpretation of Microcontroller Code: Intervals meet Congruences. Science of Computer Programming 78:862-883.
Brauer, J. and King, A. (2012). Transfer Function Synthesis without Quantifier Elimination (long version). Logical Methods in Computer Science [Online] 8. Available at: http://www.cs.kent.ac.uk/pubs/2012/3238.
Barrett, E. and King, A. (2012). Range and Set Abstraction using SAT. Electronic Notes in Theoretical Computer Science [Online] 267:93-107. Available at: http://www.cs.kent.ac.uk/pubs/2010/3050.
Howe, J. and King, A. (2012). A Pearl on SAT and SMT Solving in Prolog. Theoretical Computer Science [Online] 435:43-55. Available at: http://www.cs.kent.ac.uk/pubs/2012/3136.
Kriener, J. and King, A. (2011). RedAlert: Determinacy Inference for Prolog. Theory and Practice of Logic Programming [Online] 11:182-196. Available at: http://www.cs.kent.ac.uk/pubs/2011/3108.
Howe, J. and King, A. (2011). A Pearl on SAT Solving in Prolog (Logic Programming Newsletter). Logic Programming Newsletter [Online] 2011:182-196. Available at: http://www.cs.kent.ac.uk/pubs/2011/3095.
Howe, J., King, A. and Lawrence-Jones, C. (2010). Quadtrees as an Abstract Domain. Electronic Notes in Theoretical Computer Science [Online] 267:182-196. Available at: http://www.cs.kent.ac.uk/pubs/2010/3051.
Simon, A., King, A. and Howe, J. (2010). The Two Variable Per Inequality Abstract Domain. Higher-Order and Symbolic Computation [Online] 31:182-196. Available at: http://www.cs.kent.ac.uk/pubs/2010/3167.
Genaim, S. and King, A. (2008). Inferring non-suspension conditions for logic programs with dynamic scheduling. ACM Transactions on Computational Logic [Online] 9:182-196. Available at: http://dx.doi.org/10.1145/1352582.1352585.
Kettle, N. and King, A. (2008). An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [Online] 27:764-777. Available at: http://dx.doi.org/10.1109/TCAD.2008.917592.
Jonathan, M. and King, A. (2006). Control Generation by Program Transformation. Fundamenta informaticae [Online] 69:179-218. Available at: http://iospress.metapress.com/content/dg3x9l3ljw4p9a2j/?p=80a3bd845c2448a3a715e89f4ae6906c&pi=6.
Benoy, F., King, A. and Mesnard, F. (2005). Computing Convex Hulls with a Linear Solver. Theory and Practice of Logic Programming [Online] 5:259-271. Available at: http://dx.doi.org/10.1017/S1471068404002261.
Howe, J. and King, A. (2003). Efficient Groundness Analysis in Prolog. Theory and Practice of Logic Programming [Online] 3:95-124. Available at: http://dx.doi.org/10.1017/S1471068402001485.
Howe, J. and King, A. (2003). Three Optimisations for Sharing. Theory and Practice of Logic Programming [Online] 3:243-257. Available at: http://dx.doi.org/10.1017/S1471068402001497.
King, A. and Lu, L. (2002). A Backward Analysis for Constraint Logic Programs. Theory and Practice of Logic Programming [Online] 2:517-547. Available at: http://dx.doi.org/10.1017/S1471068402001436.
Smaus, J., Hill, P. and King, A. (2001). Verifying termination and error-freedom of logic programs with block declarations. Theory and Practice of Logic Programming [Online] 1:447-486. Available at: http://dx.doi.org/10.1017/S1471068401001107.
Heaton, A. et al. (2000). A Simple Polynomial Groundness Analysis for Logic Programs. Journal of Logic Programming [Online] 45:143-156. Available at: http://dx.doi.org/10.1016/S0743-1066(00)00006-6.
Howe, J. and King, A. (2000). Abstracting numeric constraints with Boolean functions. Information Processing Letters [Online] 75:17-23. Available at: http://dx.doi.org/10.1016/S0020-0190(00)00081-8.
King, A. (2000). Pair-sharing over rational trees. Journal of Logic Programming [Online] 46:139-155. Available at: http://dx.doi.org/10.1016/S0743-1066(00)00009-1.
Shen, K., Santos Costa, V. and King, A. (1999). Distance: a New Metric for Controlling Granularity for Parallel Execution. Journal of Functional and Logic Programming [Online] 1999:1-23. Available at: http://danae.uni-muenster.de/lehre/kuchen/JFLP/articles/1999/S99-01/S99-01.html.
Hill, P. and King, A. (1998). Detecting and Exploiting Determinacy in Logic Programs. Computational Logic Newsletter 4:100-101.
Hill, P. and King, A. (1997). Determinacy and Determinacy Analysis. Journal of Programming Languages [Online] 5:135-171. Available at: http://www.informatik.uni-trier.de/~ley/db/journals/jpl/jpl5.html.
King, A. (1994). High Precision Sharing Analysis. Journal of Programming Languages 2:149-191.
Book section
Howe, J., Robbins, E. and King, A. (2017). Theory Learning with Symmetry Breaking. in: Pientka, B. ed. International Symposium on Principles and Practice of Declarative Programming. Namur, Belgium: ACM.
Robbins, E., King, A. and Schrijvers, T. (2016). From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes. in: Guha, A. and Chong, S. eds. Symposium on Principles of Programming Languages. St. Petersburg, Florida, USA: ACM Press, pp. 191-203. Available at: http://dx.doi.org/10.1145/2837614.2837633.
Singh, R. and King, A. (2015). Partial Evaluation for Java Malware Detection. in: Proietti, M. and Seki, H. eds. Twenty fourth International Symposium on Logic-Based Program Synthesis and Transformation. Springer, pp. 133-147. Available at: http://dx.doi.org/10.1007/978-3-319-17822-6_8.
Jones, W., Chawdhary, A. and King, A. (2015). Revisiting Volgenant-Jonker for Approximating Graph Edit Distance. in: Liu, C. -L. et al. eds. Graph-based Representations in Pattern Recognition. Springer, pp. 98-107. Available at: http://dx.doi.org/10.1007/978-3-319-18224-7.
Kriener, J. and King, A. (2014). Semantics for Prolog with Cut Revisited. in: Sumii, E. and Codish, M. eds. Functional and Logic Programming. Springer Verlag, pp. 270-284.
Chawdhary, A., Robbins, E. and King, A. (2014). Simple and Efficient Algorithms for Octagons. in: Garrigue, J. ed. Twelfth Asian Symposium on Programming Languages and Systems. Springer, pp. 296-313. Available at: http://dx.doi.org/10.1007/978-3-319-12736-1_16.
Howe, J. and King, A. (2012). Polyhedral Analysis using Parametric Objectives. in: Min'e, A. and Schmidt, D. A. eds. Static Analysis Symposium. Springer, pp. 41-57. Available at: http://www.cs.kent.ac.uk/pubs/2012/3223.
Kriener, J. and King, A. (2012). Mutual Exclusion by Interpolation: 11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012, Proceedings. in: Schrijvers, T. and Thiemann, P. eds. Functional and Logic Programming. Springer, pp. 182-196. Available at: http://dx.doi.org/10.1007/978-3-642-29822-6_16.
Biallas, S. et al. (2012). Loop Leaping with Closures. in: Min'e, A. and Schmidt, D. A. eds. Static Analysis Symposium. Springer, pp. 214-230. Available at: http://www.cs.kent.ac.uk/pubs/2012/3230.
Brauer, J. and King, A. (2011). Transfer Function Synthesis without Quantifier Elimination. in: Barthe, G. ed. European Symposium on Programming. Springer-Verlag, pp. 182-196. Available at: http://www.cs.kent.ac.uk/pubs/2011/3072.
Brauer, J., King, A. and Kriener, J. (2011). Existential Quantification as Incremental SAT: 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings. in: Gopalakrishnan, G. and Qadeer, S. eds. Computer Aided Verification. Springer, pp. 191-207. Available at: http://dx.doi.org/10.1007/978-3-642-22110-1_17.
Brauer, J. and King, A. (2011). Approximate Quantifier Elimination for Propositional Boolean Formulae. in: Bobaru, M. et al. eds. NASA Formal Methods. Springer-Verlag, pp. 182-196. Available at: http://www.cs.kent.ac.uk/pubs/2011/3084.
Brauer, J. and King, A. (2010). Automatic Abstraction for Intervals using Boolean Formulae. in: Cousot, R. and Martel, M. eds. Static Analysis Symposium. Springer-Verlag, pp. 182-196. Available at: http://www.cs.kent.ac.uk/pubs/2010/3015.
King, A. and Sondergaard, H. (2010). Automatic Abstraction for Congruences. in: Barthe, G. and Hermenegildo, M. V. eds. Verification, Model Checking, and Abstract Interpretation. Springer-Verlag, pp. 182-196. Available at: http://www.cs.kent.ac.uk/pubs/2010/2966.
Howe, J. and King, A. (2010). A Pearl on SAT Solving in Prolog. in: Blume, M. and Vidal, G. eds. Functional and Logic Programming. Springer-Verlag, pp. 182-196. Available at: http://www.cs.kent.ac.uk/pubs/2010/2970.
Brauer, J., King, A. and Kowalewski, S. (2010). Range Analysis of Microcontroller Code Using Bit-Level Congruences: 15th International Workshop, FMICS 2010, Antwerp, Belgium, September 20-21, 2010. Proceedings. in: Kowalewski, S. and Roveri, M. eds. Formal Methods for Industrial Critical Systems. Springer, pp. 82-98. Available at: http://dx.doi.org/10.1007/978-3-642-15898-8_6.
Charles, P., King, A. and Howe, J. (2009). Integer Polyhedra for Program Analysis: 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings. in: Goldberg, A. and Zhou, Y. eds. Algorithmic Aspects in Information and Management,. Springer, pp. 85-99. Available at: http://dx.doi.org/10.1007/978-3-642-02158-9_9.
Howe, J. and King, A. (2009). Logahedra: a New Weakly Relational Domain: 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings. in: Zhiming, L. and Anders, R. eds. Automated Technology for Verification and Analysis. Springer, pp. 306-320. Available at: http://dx.doi.org/10.1007/978-3-642-04761-9_23.
King, A. and Sondergaard, H. (2008). Inferring Congruence Equations using SAT: 20th International Conference, CAV 2008 Princeton, NJ, USA, July 7-14, 2008 Proceedings. in: Gupta, A. and Malik, S. eds. Computer-Aided Verification. Springer, pp. 281-293. Available at: http://dx.doi.org/10.1007/978-3-540-70545-1_26.
Simon, A. and King, A. (2007). Widening Polyhedra with Landmarks: 4th Asian Symposium, APLAS 2006, Sydney, Australia, November 8-10, 2006. Proceedings. in: Kobayashi, N. ed. Asian Symposium on Programming Languages and Systems. Springer, pp. 166-182. Available at: http://dx.doi.org/10.1007/11924661_11.
Simon, A. and King, A. (2007). Taming the Wrapping of Integer Arithmetic: 14th International Symposium, SAS 2007, Kongens Lyngby, Denmark, August 22-24, 2007. Proceedings. in: File, G. and Nielson, H. R. eds. Static Analysis Symposium. Springer, pp. 182-196. Available at: http://dx.doi.org/10.1007/978-3-540-74061-2_8.
Kettle, N., King, A. and Strzemecki, T. (2006). Widening ROBDDs with Prime Implicants: 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006. Proceedings. in: Hermanns, H. and Palsberg, J. eds. Tools and Algorithms for the Construction and Analysis of Systems. Springer, pp. 105-119. Available at: http://dx.doi.org/10.1007/11691372_7.
King, A., Lu, L. and Genaim, S. (2006). Detecting Determinacy in Prolog Programs: 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006. Proceedings. in: Etalle, S. and Truszczynski, M. eds. Logic Programming. Springer, pp. 132-147. Available at: http://dx.doi.org/10.1007/11799573_12.
Li, X., King, A. and Lu, L. (2006). Collapsing Closures: 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006. Proceedings. in: Etalle, S. and Truszczynski, M. eds. Logic Programming. Springer, pp. 148-162. Available at: http://dx.doi.org/10.1007/11799573_13.
Li, X., King, A. and Lu, L. (2006). Lazy Set-Sharing Analysis: 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006. Proceedings. in: Wadler, P. and Hagiya, M. eds. Functional and Logic Programming. Springer, pp. 177-191. Available at: http://dx.doi.org/10.1007/11737414_13.
Lu, L. and King, A. (2005). Determinacy Inference for Logic Programs: 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005. Proceedings. in: Sagiv, S. ed. European Symposium on Programming. Springer, pp. 108-123. Available at: http://dx.doi.org/10.1007/978-3-540-31987-0_9.
Simon, A. and King, A. (2005). Exploiting Sparsity in Polyhedral Analysis: 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005. Proceedings. in: Hankin, C. and Siveroni, I. eds. Static Analysis Symposium. Springer, pp. 336-351. Available at: http://dx.doi.org/10.1007/11547662_23.
Lu, L. and King, A. (2004). Backward Pair Sharing Analysis: 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004. Proceedings. in: Kameyama, Y. and Stuckey, P. eds. Functional and Logic Programming. Springer, pp. 132-146. Available at: http://dx.doi.org/10.1007/978-3-540-24754-8_11.
Howe, J., King, A. and Lu, L. (2004). Analysing Logic Programs by Reasoning Backwards: A Decade of Research Advances in Logic-Based Program Development. in: Bruynooghe, M. and Lau, K. -K. eds. Program Development in Computational Logic. Springer, pp. 152-188. Available at: http://dx.doi.org/10.1007/978-3-540-25951-0_6.
Martin, J. and King, A. (2004). On the Inference of Natural Level Mappings: A Decade of Research Advances in Logic-Based Program Development. in: Bruynooghe, M. and Lau, K. -K. eds. Program Development in Computational Logic,. Springer, pp. 432-452. Available at: http://dx.doi.org/10.1007/978-3-540-25951-0_13.
Genaim, S. and King, A. (2003). Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling: 12th European Symposium on Programming, ESOP 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 711, 2003 Proceedings. in: Degano, P. ed. European Symposium on Programming. Springer, pp. 84-98. Available at: http://dx.doi.org/10.1007/3-540-36575-3_7.
King, A. and Lu, L. (2003). Forward versus Backward Verification of Logic Programs: 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003. Proceedings. in: Palamidessi, C. ed. Logic Programming. Springer, pp. 315-330. Available at: http://dx.doi.org/10.1007/978-3-540-24599-5_22.
Lu, L. and King, A. (2002). Backward Type Inference Generalises Type Checking. in: Hermenegildo, M. V. and Puebla, G. eds. Static Analysis Symposium. Berlin: Springer-Verlag, pp. 85-101. Available at: http://dx.doi.org/10.1007/3-540-45789-5_9.
Simon, A. and King, A. (2002). Analyzing String Buffers in C. in: Kirchner, H. and Ringeissen, C. eds. International Conference on Algebraic Methodology and Software Technology. Springer, pp. 365-379. Available at: http://dx.doi.org/10.1007/3-540-45719-4_25.
Simon, A., King, A. and Howe, J. (2002). Two Variables per Linear Inequality as an Abstract Domain. in: Leuschel, M. ed. Logic Based Program Synthesis and Transformation. Berlin: Springer-Verlag, pp. 71-89. Available at: http://dx.doi.org/10.1007/3-540-45013-0_7.
Howe, J. and King, A. (2001). Positive Boolean Functions as Multiheaded Clauses. in: Codognet, P. ed. International Conference on Logic Programming. London: Springer-Verlag, pp. 120-134. Available at: http://dx.doi.org/10.1007/3-540-45635-X_16.
Howe, J. and King, A. (2000). Implementing Groundness Analysis with Definite Boolean Functions: 9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 April 2, 2000 Proceedings. in: Smolka, G. ed. European Symposium on Programming. Springer, pp. 200-214. Available at: http://dx.doi.org/10.1007/3-540-46425-5_13.
Heaton, A., Hill, P. and King, A. (2000). Abstract Domains for Universal and Existential Properties:9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 April 2, 2000 Proceedings. in: Smolka, G. ed. Programming Languages and Systems. Springer, pp. 150-164. Available at: http://dx.doi.org/10.1007/3-540-46425-5_10.
Smaus, J., Hill, P. and King, A. (1999). Mode Analysis Domains for Typed Logic Programs. in: Bossi, A. ed. Logic Programming, Synthesis and Transformation. Springer-Verlag, pp. 82-101.
King, A., Smaus, J. and Hill, P. (1999). Quotienting Share for Dependency Analysis: 8th European Symposium on Programming, ESOP'99 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'99 Amsterdam, The Netherlands, March 2228, 1999 Proceedings. in: Swierstra, D. ed. Programming Languages and Systems. Springer, pp. 59-73. Available at: http://dx.doi.org/10.1007/3-540-49099-X_5.
Howe, J. and King, A. (1999). Specialising Finite Domain Programs using Polyhedra. in: Bossi, A. ed. Lecture Notes In Computer Science. Springer-Verlag, pp. 118-135.
Heaton, A., Hill, P. and King, A. (1998). Analysis of Logic Programs with Delay. in: Fuchs, N. ed. Logic Program Synthesis and Transformation. Springer-Verlag, pp. 148-167. Available at: http://dx.doi.org/10.1007/3-540-49674-2_8.
Smaus, J., Hill, P. and King, A. (1998). Preventing Instantiation Errors and Loops for Logic Programs with Several Modes Using block Declarations. in: Flener, P. ed. Logic Programming, Synthesis and Transformation. Springer, pp. 182-196.
Smaus, J., Hill, P. and King, A. (1998). Termination of Logic Programs with block Declarations Running in Several Modes. in: Palamidessi, C. ed. International Symposium on Programming Languages: Implementations, Logics and Programs. Springer-Verlag, see also http://www.springer.de/comp/lncs/index.html, pp. 182-196.
Shen, K., Costa, V. and King, A. (1998). Distance: a New Metric for Controlling Granularity for Parallel Execution. in: Jaffar, J. ed. Joint International Conference and Symposium for Logic Programming. MIT Press, pp. 85-99.
King, A., Shen, K. and Benoy, F. (1997). Lower-bound Time-Complexity Analysis of Logic Programs. in: Maluszynski, J. ed. International Symposium on Logic programming . MIT Press, pp. 261-276.
Martin, J. and King, A. (1997). Generating Efficient, Terminating Logic Programs. in: Bidoit, M. and Dauchet, M. eds. Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development . Springer Verlag, pp. 173-184.
Benoy, F. and King, A. (1996). Inferring Argument Size Relationships with CLP(R). in: Gallagher, J. ed. Logic Programming Synthesis and Transformation . Springer-Verlag, pp. 204-223. Available at: http://www.cs.kent.ac.uk/pubs/1997/510.
Martin, J. and King, A. (1996). Typed Norms for Typed Logic Programs. in: Gallagher, J. ed. Logic Program Synthesis and Transformation. Springer-Verlag, pp. 224-238. Available at: http://dx.doi.org/10.1007/3-540-62718-9_13.
Kemp, B., King, A. and Soper, P. (1994). Continuation Compilation for Concurrent Logic Programming. in: Crespo, A. ed. Symposium on Artificial Intelligence in Real-time Control. Pergamon, pp. 299-306.
King, A. (1994). A Framework for Freeness Analysis. in: Tick, E. and Succi, G. eds. Implementations of Logic Programming Systems. Dordrecht: Kluwer Academic Publishers, pp. 137-149.
King, A. (1994). A Synergistic Analysis for Sharing and Groundness which traces Linearity. in: Sannella, D. ed. European Symposium on Programming. Springer-Verlag, pp. 363-378.
King, A. and Soper, P. (1994). Depth-k Sharing and Freeness. in: Van Hentenryck, P. ed. International Conference on Logic Programming. MIT Press, pp. 553-568.
King, A. and Soper, P. (1992). Ordering Optimizations for Concurrent Logic Programs. in: Nerode, A. and Taitslin, M. eds. Logical Foundations of Computer Science. Springer, pp. 221-228. Available at: http://dx.doi.org/10.1007/BFb0023876.
Barrett, E. and King, A. (1992). Range Analysis of Binaries with Minimal Effort. in: Formal Methods for Industrial Critical Systems. Springer, pp. 93-107. Available at: http://dx.doi.org/10.1007/978-3-642-32469-7_7.
King, A. and Soper, P. (1992). Schedule Analysis of Concurrent Logic Programs. in: Apt, K. ed. Joint International Conference and Symposium for Logic Programming. USA: MIT Press, pp. 478-492.
King, A. and Soper, P. (1992). Serialisation Analysis of Concurrent Logic Programs. in: Kirchner, H. and Levi, G. eds. Algebraic and Logic Programming. Springer, pp. 322-334.
King, A. and Soper, P. (1991). Reducing Scheduling Overheads for Concurrent Logic Programs. in: Boley, H. and Richter, M. eds. Processing Declarative Knowledge. Springer-Verlag, pp. 279-286.
Monograph
Biallas, S. et al. (2012). Loop Leaping with Closures (proof appendix for conference submission). University of Kent, School of Computing. Available at: http://www.cs.kent.ac.uk/pubs/2012/3230/.
Conference or workshop item
Kriener, J., King, A. and Blazy, S. (2013). Proofs You Can Believe In: Proving Equivalences Between Prolog Semantics in Coq. in: Schrijvers, T. ed. 15th International Symposium on Principles and Practice of Declarative Programming PPDP 2013. New York: ACM Press, pp. 37-48. Available at: http://dx.doi.org/10.1145/2505879.2505886.
Bourquin, M., King, A. and Robbins, E. (2013). BinSlayer: Accurate Comparison of Binary Executables. in: 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop. New York: ACM. Available at: http://dx.doi.org/10.1145/2430553.2430557.
Robbins, E., King, A. and Jacob, H. (2013). Theory Propagation and Rational-Trees. in: Schrijvers, T. ed. 15th International Symposium on Principles and Practice of Declarative Programming PPDP 2013. New York: ACM Press, pp. 193-204. Available at: http://dx.doi.org/10.1145/2505879.2505901.
King, A. et al. (2012). Analysis of Executables: Benefits and Challenges. in: Analysis of Executables: Benefits and Challenges. pp. 100-116. Available at: http://dx.doi.org/10.4230/DagRep.2.1.100.
Kriener, J. and King, A. (2012). Mutual Exclusion by Interpolation. in: Schrijvers, T. and Thiemann, P. eds. Eleventh International Symposium on Functional and Logic Programming. Kobe, Japan: Springer, pp. 182-196. Available at: http://www.cs.kent.ac.uk/pubs/2012/3201.
Kriener, J. and King, A. (2011). RedAlert: Determinacy Inference for Prolog. in: 27th International Conference on Logic Programming. University of Kent, School of Computing.
Brauer, J., King, A. and Kriener, J. (2011). Existential Quantification as Incremental SAT. in: Gopalakrishnan, G. and Qadeer, S. eds. Twenty Third International Conference on Computer Aided Verification. Springer-Verlag, pp. 182-196. Available at: http://www.cs.kent.ac.uk/pubs/2011/3094.
King, A. (2008). Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry. in: Arenas, P. and Zanardini, D. eds. Proceedings on Logic-Based Methods in Programming Envrionments. Udine: CoRR, pp. 1-7.
Kettle, N. and King, A. (2006). An Anytime Symmetry Detection Algorithm for ROBDDs. in: Onodera, H. ed. 2006 Asia and South Pacific Design Automation Conference. IEEE Press, pp. 243-248. Available at: http://dx.doi.org/10.1145/1118299.1118364.
Datasets / databases
Robbins, E., King, A. and Schrijvers, T. (2015). Benchmarks, assembly files, and witnesses. [On-line].
Edited book
Kiselyov, O. and King, A. eds. (2016). International Symposium on Functional and Logic Programming. Switzerland: Springer International Publishing.
Chitil, O., King, A. and Olivier, D. eds. (2014). PPDP '14: Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming. [Online]. ACM. Available at: http://dl.acm.org/citation.cfm?id=2643135.
King, A. (2008). Logic-Based Program Synthesis and Transformation. King, A. ed. Springer-Verlag.
Research report (external)
Robbins, E., King, A. and Schrijvers, T. (2015). Proof appendix to accompany the paper, "From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes". University of Kent.
Kriener, J. and King, A. (2011). Determinacy Inference for Prolog (appendix for conference submission). [Online]. Canterbury, CT1 7NF, UK: University of Kent, School of Computing. Available at: http://www.cs.kent.ac.uk/pubs/2011/3107.
Kettle, N. and King, A. (2006). Proof of New Decompositional Results for Generalized Symmetries (appendix for journal paper). University of Kent, Canterbury, Kent, CT2 7NF: University of Kent, School of Computing.
Li, X., King, A. and Lu, L. (2006). Correctness of Closure Collapsing (appendix to conference submission). [Online]. University of Kent, Canterbury, CT2 7NF: University of Kent, School of Computing. Available at: http://dx.doi.org/10.1007/11799573_13.
Kettle, N. and King, A. (2006). Proof of New Implicational Relationships between Generalized Symmetries (appendix for journal paper). University of Kent, Canterbury, Kent, CT2 7NF: University of Kent, School of Computing.
King, A. and Lu, L. (2003). Forward versus Backward Verification of Logic Programs (appendix for conference submission). [Online]. University of Kent: University of Kent, School of Computing. Available at: http://www.cs.kent.ac.uk/pubs/2003/1618.
Howe, J. and King, A. (2002). Correctness of Set-Sharing with Linearity. Canterbury: University of Kent, School of Computing.
Howe, J. and King, A. (2001). Widening BDDs. University of Kent, School of Computing.
King, A. and Lu, L. (2001). A Backward Analysis for Constraint Logic Programs (appendix for journal paper). University of Kent at Canterbury, Kent, CT2 7NF, UK: University of Kent, School of Computing.
Heaton, A. and King, A. (2000). Abstracting Builtins for Groundness Analysis. Computing Laboratory: University of Kent, School of Computing.
Benoy, F. and King, A. (1999). An Isomorphism between Abstract Polyhedral Cones and Definite Boolean Functions. University of Kent: University of Kent, School of Computing.
Howe, J. and King, A. (1999). A Semantic Basis for Specialising Domain Constraints. Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK: University of Kent, School of Computing.
King, A. and Bryans, J. (1998). Using Probability to Reason about Soft Deadlines. University of Kent, School of Computing.
King, A. (1995). Share x Free Revisited. University of Kent, Canterbury, UK: University of Kent, School of Computing.
King, A. and Longley, M. (1995). Abstract Matching Can Improve on Abstract Unification. University of Kent, Canterbury, UK: University of Kent, School of Computing.
Total publications in KAR: 114 [See all in KAR]

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

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

Last Updated: 23/07/2017