Items where Author, Editor or other role is "King, Andy"

B

Bocchi, Laura and King, Andy and Murgia, Maurizio (2023) Asynchronous Subtyping by Trace Relaxation. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lecture notes in computer science, 14570 . Springer, pp. 207-226. (In press) (doi:10.1007/978-3-031-57246-3_12) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:105395)

Brauer, Jorg, King, Andy, Kowalewski, Stefan (2013) Abstract Interpretation of Microcontroller Code: Intervals meet Congruences. Science of Computer Programming, 78 (7). pp. 862-883. ISSN 0167-6423. (doi:10.1016/j.scico.2012.06.001) (KAR id:30802)

Bourquin, Martial and King, Andy and Robbins, Edward (2013) BinSlayer: Accurate Comparison of Binary Executables. In: Proceedings of the 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop. POPL Principles of Programming Languages . ACM, New York, USA. ISBN 978-1-4503-1857-0. (doi:10.1145/2430553.2430557) (KAR id:37627)

Barrett, Edd, King, Andy (2012) Range and Set Abstraction using SAT. Electronic Notes in Theoretical Computer Science, 267 (1). pp. 93-107. ISSN 978-3-642-32468-0. (doi:10.1016/j.entcs.2010.09.003) (KAR id:30621)

Biallas, Sebastian and Brauer, Jorg and King, Andy and Kowalewski, Stefan (2012) Loop Leaping with Closures. In: Min'e, Antoine and Schmidt, David A., eds. Static Analysis Symposium. Lecture Notes in Computer Science, 7460 . Springer, pp. 214-230. ISBN 978-3-642-33124-4. (doi:10.1007/978-3-642-33125-1_16) (KAR id:30791)

Brauer, Jorg, King, Andy (2012) Transfer Function Synthesis without Quantifier Elimination (long version). Logical Methods in Computer Science, 8 (2012). (KAR id:30800)

Biallas, Sebastian and Brauer, Jorg and King, Andy and Kowalewski, Stefan (2012) Loop Leaping with Closures (proof appendix for conference submission). Technical report. University of Kent, School of Computing (KAR id:37622)

Brauer, Jorg and King, Andy and Kriener, Jael (2011) Existential Quantification as Incremental SAT: 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings. In: Gopalakrishnan, Ganesh and Qadeer, Shaz, eds. Computer Aided Verification. Lecture Notes in Computer Science, 6806 . Springer, Berlin, Germany, pp. 191-207. ISBN 978-3-642-22109-5. E-ISBN 978-3-642-22110-1. (doi:10.1007/978-3-642-22110-1_17) (KAR id:37589)

Brauer, Jorg and King, Andy (2011) Approximate Quantifier Elimination for Propositional Boolean Formulae. In: Bobaru, Mihaela and Havelund, Klaus and Holzmann, Gerard and Joshi, Rajeev, eds. NASA Formal Methods. Lecture Notes in Computer Science, 6617 . Springer-Verlag, pp. 182-196. ISBN 978-3-642-20397-8. (KAR id:30763)

Brauer, Jorg and King, Andy (2011) Transfer Function Synthesis without Quantifier Elimination. In: Barthe, Gilles, ed. European Symposium on Programming. Lecture Notes in Computer Science, 6602 . Springer-Verlag, pp. 182-196. ISBN 978-3-642-19717-8. (KAR id:30765)

Brauer, Jorg and King, Andy (2010) Automatic Abstraction for Intervals using Boolean Formulae. In: Cousot, Radhia and Martel, Matthieu, eds. Static Analysis Symposium. Lecture Notes in Computer Science, 6337 . Springer-Verlag, pp. 182-196. ISBN 978-3-642-15768-4. (KAR id:30633)

Brauer, Jorg and King, Andy and Kowalewski, Stefan (2010) Range Analysis of Microcontroller Code Using Bit-Level Congruences: 15th International Workshop, FMICS 2010, Antwerp, Belgium, September 20-21, 2010. Proceedings. In: Kowalewski, Stefan and Roveri, Marco, eds. Formal Methods for Industrial Critical Systems. Lecture Notes in Computer Science, 6371 . Springer, pp. 82-98. ISBN 978-3-642-15897-1. (doi:10.1007/978-3-642-15898-8_6) (KAR id:37590)

Benoy, Florence, King, Andy, Mesnard, Fred (2005) Computing Convex Hulls with a Linear Solver. Theory and Practice of Logic Programming, 5 (1-2). pp. 259-271. ISSN 1471-0684. (doi:10.1017/S1471068404002261) (KAR id:37639)

Benoy, Patricia Mary (2002) Polyhedral domains for abstract interpretation in logic programming. Doctor of Philosophy (PhD) thesis, University of Kent. (doi:10.22024/UniKent/01.02.86251) (KAR id:86251)

Benoy, Florence, King, Andy (1999) An Isomorphism between Abstract Polyhedral Cones and Definite Boolean Functions. University of Kent, School of Computing, University of Kent, 21 pp. (KAR id:21867)

Benoy, Florence and King, Andy (1996) Inferring Argument Size Relationships with CLP(R). In: Gallagher, John, ed. Logic Logic Program Synthesis and Transformation 6th International Workshop. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 204-223. ISBN 978-3-540-62718-0. E-ISBN 978-3-540-68494-7. (doi:10.1007/3-540-62718-9_12) (KAR id:21464)

Barrett, Edd and King, Andy (1992) Range Analysis of Binaries with Minimal Effort. In: Formal Methods for Industrial Critical Systems. Lecture Notes in Computer Science, 7437 . Springer, pp. 93-107. ISBN 978-3-642-32468-0. (doi:10.1007/978-3-642-32469-7_7) (KAR id:41116)

C

Chawdhary, Aziem, Robbins, Ed, King, Andy (2019) Incrementally Closing Octagons. Formal Methods in System Design, 54 (2). pp. 232-277. ISSN 0925-9856. E-ISSN 1572-8102. (doi:10.1007/s10703-017-0314-7) (KAR id:64181)

Chawdhary, Aziem and King, Andy (2018) Closing the Performance Gap between Doubles and Rationals for Octagons. In: Podelski, Andreas, ed. Static Analysis. Lecture Notes in Computer Science, 11002 . Springer, pp. 187-204. ISBN 978-3-319-99724-7. E-ISBN 978-3-319-99725-4. (doi:10.1007/978-3-319-99725-4_13) (KAR id:67227)

Chawdhary, Aziem and King, Andy (2017) Compact Difference Bound Matrices. In: Chang, Evan, ed. 15th Asian Symposium on Programming Languages and Systems. Lecture Notes in Computer Science . Springer, pp. 471-490. ISBN 978-3-319-71236-9. (doi:10.1007/978-3-319-71237-6_23) (KAR id:62853)

Chawdhary, Aziem, King, Andy, Singh, Ranjeet (2016) Partial Evaluation of String Obfuscations for Java Malware Detection. Formal Aspects of Computing, 29 (1). ISSN 0934-5043. E-ISSN 1433-299X. (doi:10.1007/s00165-016-0357-3) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:53716)

Chawdhary, Aziem and Robbins, Ed and King, Andy (2014) Simple and Efficient Algorithms for Octagons. In: Garrigue, Jacques, ed. Twelfth Asian Symposium on Programming Languages and Systems. Lecture Notes in Computer Science, 8858 . Springer, pp. 296-313. ISBN 978-3-319-12735-4. E-ISBN 978-3-319-12736-1. (doi:10.1007/978-3-319-12736-1_16) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:42815)

Chitil, Olaf and King, Andy and Olivier, Danvy, eds. (2014) PPDP '14: Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming. ACM, 288 pp. ISBN 978-1-4503-2947-7. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:58670)

Charles, Philip and King, Andy and Howe, Jacob M. (2009) Integer Polyhedra for Program Analysis: 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings. In: Goldberg, Andrew and Zhou, Yunhong, eds. Algorithmic Aspects in Information and Management,. Lecture Notes in Computer Science, 5564 . Springer, pp. 85-99. ISBN 978-3-642-02157-2. (doi:10.1007/978-3-642-02158-9_9) (KAR id:37592)

D

De Schreye, Danny and Janssens, Gerda and King, Andy, eds. (2012) PPDP '12 Proceedings of the 14th symposium on Principles and practice of declarative programming. ACM, New York, USA, 218 pp. ISBN 978-1-4503-1522-7. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:37617)

G

Genaim, Samir, King, Andy (2008) Inferring non-suspension conditions for logic programs with dynamic scheduling. ACM Transactions on Computational Logic, 9 (3). pp. 182-196. ISSN 1529-3785. (doi:10.1145/1352582.1352585) (KAR id:15105)

Genaim, Samir and King, Andy (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 7–11, 2003 Proceedings. In: Degano, Pierpaolo, ed. European Symposium on Programming. Lecture Notes in Computer Science . Springer, pp. 84-98. ISBN 978-3-540-00886-6. (doi:10.1007/3-540-36575-3_7) (KAR id:37612)

H

Howe, Jacob M., King, Andy, Simon, Axel (2019) Incremental Closure for Systems of Two Variables Per Inequality. Theoretical Computer Science, 768 . pp. 1-64. ISSN 0304-3975. (doi:10.1016/j.tcs.2018.12.001) (KAR id:70546)

Howe, Jacob M. and Robbins, Ed and King, Andy (2017) Theory Learning with Symmetry Breaking. In: Pientka, Brigitte, ed. International Symposium on Principles and Practice of Declarative Programming. ACM, Namur, Belgium, pp. 85-96. ISBN 978-1-4503-5291-8. (doi:10.1145/3131851.3131861) (KAR id:62377)

Howe, Jacob M. and King, Andy (2012) Polyhedral Analysis using Parametric Objectives. In: Min'e, Antoine and Schmidt, David A., eds. Static Analysis Symposium. Lecture Notes in Computer Science, 7460 . Springer, pp. 41-57. ISBN 978-3-642-33124-4. (KAR id:30793)

Howe, Jacob M., King, Andy (2012) A Pearl on SAT and SMT Solving in Prolog. Theoretical Computer Science, 435 . pp. 43-55. ISSN 0304-3975. (doi:10.1016/j.tcs.2012.02.024) (KAR id:30812)

Howe, Jacob M., King, Andy (2011) A Pearl on SAT Solving in Prolog (Logic Programming Newsletter). Logic Programming Newsletter, 2011 (3). pp. 182-196. (KAR id:30769)

Howe, Jacob M., King, Andy, Lawrence-Jones, Charles (2010) Quadtrees as an Abstract Domain. Electronic Notes in Theoretical Computer Science, 267 (1). pp. 182-196. (doi:10.1016/j.entcs.2010.09.008) (KAR id:30620)

Howe, Jacob M. and King, Andy (2010) A Pearl on SAT Solving in Prolog. In: Blume, Matthias and Vidal, German, eds. Functional and Logic Programming. Lecture Notes in Computer Science . Springer-Verlag, pp. 182-196. ISBN 978-3-642-12250-7. (doi:10.1007/978-3-642-12251-4_13) (KAR id:30674)

Howe, Jacob M. and King, Andy (2009) Logahedra: a New Weakly Relational Domain: 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings. In: Zhiming, Lu and Anders, Ravn, eds. Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, 5799 . Springer, pp. 306-320. ISBN 978-3-642-04760-2. (doi:10.1007/978-3-642-04761-9_23) (KAR id:37591)

Howe, Jacob M. and King, Andy and Lu, Lunjin (2004) Analysing Logic Programs by Reasoning Backwards: A Decade of Research Advances in Logic-Based Program Development. In: Bruynooghe, Maurice and Lau, Kung-Kiu, eds. Program Development in Computational Logic. Lecture Notes in Computer Science, 3049 . Springer, pp. 152-188. ISBN 978-3-540-22152-4. (doi:10.1007/978-3-540-25951-0_6) (KAR id:37608)

Howe, Jacob M., King, Andy (2003) Three Optimisations for Sharing. Theory and Practice of Logic Programming, 3 (2). pp. 243-257. ISSN 1471-0684. (doi:10.1017/S1471068402001497) (KAR id:37579)

Howe, Jacob M., King, Andy (2003) Efficient Groundness Analysis in Prolog. Theory and Practice of Logic Programming, 3 (1). pp. 95-124. ISSN 1471-0684. (doi:10.1017/S1471068402001485) (KAR id:37536)

Howe, Jacob M., King, Andy (2002) Correctness of Set-Sharing with Linearity. University of Kent, School of Computing, Canterbury, 5 pp. (KAR id:13819)

Howe, Jacob M. and King, Andy (2001) Positive Boolean Functions as Multiheaded Clauses. In: Codognet, Philippe, ed. International Conference on Logic Programming. Lecture Notes in Computer Science, 2237 . Springer-Verlag, London, pp. 120-134. ISBN 3-540-42935-2. (doi:10.1007/3-540-45635-X_16) (KAR id:13522)

Howe, Jacob M., King, Andy (2001) Widening BDDs. University of Kent, School of Computing, 9 pp. (KAR id:13611)

Heaton, Andrew, Abo-Zaed, Mohammad, King, Andy, Micheal, Codish (2000) A Simple Polynomial Groundness Analysis for Logic Programs. Journal of Logic Programming, 45 (1-3). pp. 143-156. ISSN 0743-1066. (doi:10.1016/S0743-1066(00)00006-6) (KAR id:37583)

Howe, Jacob M., King, Andy (2000) Abstracting numeric constraints with Boolean functions. Information Processing Letters, 75 (1-2). pp. 17-23. ISSN 0020-0190. (doi:10.1016/S0020-0190(00)00081-8) (KAR id:16241)

Heaton, Andrew, King, Andy (2000) Abstracting Builtins for Groundness Analysis. University of Kent, School of Computing, Computing Laboratory, 8 pp. (KAR id:22058)

Heaton, Andrew and Hill, Pat and King, Andy (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, Gert, ed. Programming Languages and Systems. Lecture Notes in Computer Science, 1782 . Springer, pp. 150-164. ISBN 978-3-540-67262-3. (doi:10.1007/3-540-46425-5_10) (KAR id:37619)

Howe, Jacob M. and King, Andy (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, Gert, ed. European Symposium on Programming. Lecture Notes in Computer Science, 1782 . Springer, pp. 200-214. ISBN 978-3-540-67262-3. (doi:10.1007/3-540-46425-5_13) (KAR id:37620)

Howe, Jacob M., King, Andy (1999) A Semantic Basis for Specialising Domain Constraints. University of Kent, School of Computing, Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK, 12 pp. (KAR id:21749)

Howe, Jacob M. and King, Andy (1999) Specialising Finite Domain Programs using Polyhedra. In: Bossi, Annalisa, ed. Lecture Notes In Computer Science. Lecture Notes in Computer Science, 1817 . Springer-Verlag, pp. 118-135. ISBN 978-3-540-67628-7. (KAR id:22049)

Heaton, Andrew and Hill, Pat and King, Andy (1998) Analysis of Logic Programs with Delay. In: Fuchs, Norbert, ed. Logic Program Synthesis and Transformation. Lecture Notes in Computer Science, 1463 . Springer-Verlag, pp. 148-167. ISBN 978-3-540-65074-4. (doi:10.1007/3-540-49674-2_8) (KAR id:21640)

Hill, Pat, King, Andy (1998) Detecting and Exploiting Determinacy in Logic Programs. Computational Logic Newsletter, 4 (1). pp. 100-101. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:21690)

Hill, Pat, King, Andy (1997) Determinacy and Determinacy Analysis. Journal of Programming Languages, 5 (1). pp. 135-171. ISSN 0963-9306. (KAR id:37586)

J

Jones, William, Chawdhary, Aziem, King, Andy (2017) Optimising the Volgenant–Jonker algorithm for approximating graph edit distance. Pattern Recognition Letters, 87 . pp. 47-54. ISSN 0167-8655. (doi:10.1016/j.patrec.2016.07.024) (KAR id:56765)

Jones, William and Chawdhary, Aziem and King, Andy (2015) Revisiting Volgenant-Jonker for Approximating Graph Edit Distance. In: Liu, Cheng-Lin and Luo, B. and Kropatsch, W.G. and Cheng, J., eds. Graph-based Representations in Pattern Recognition. Lecture Notes in Computer Science, 9069 . Springer, pp. 98-107. ISBN 978-3-319-18223-0. E-ISBN 978-3-319-18224-7. (doi:10.1007/978-3-319-18224-7) (KAR id:47818)

Jonathan, Martin, King, Andy (2006) Control Generation by Program Transformation. Fundamenta informaticae, 69 (1-2). pp. 179-218. ISSN 0169-2968. E-ISSN 1875-8681. (KAR id:37531)

K

Kiselyov, Oleg and King, Andy, eds. (2016) International Symposium on Functional and Logic Programming. Lecture Notes in Computer Science, 9613 . Springer International Publishing, Switzerland, 265 pp. ISBN 978-3-319-29603-6. E-ISBN 978-3-319-29604-3. (doi:10.1007/978-3-319-29604-3) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:53718)

Kriener, Jael and King, Andy (2014) Semantics for Prolog with Cut – Revisited. In: Sumii, Eijiro and Codish, Michael, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 8475 . Springer Verlag, pp. 270-284. ISBN 978-3-319-07151-0. (doi:10.1007/978-3-319-07151-0_17) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:38188)

Kriener, Jael and King, Andy and Blazy, Sandrine (2013) Proofs You Can Believe In: Proving Equivalences Between Prolog Semantics in Coq. In: Schrijvers, Tom, ed. Principles and Practice of Declarative Programming. ACM Press, New York, pp. 37-48. ISBN 978-1-4503-2154-9. (doi:10.1145/2505879.2505886) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:37524)

Kriener, Jael, King, Andy (2012) Mutual Exclusion by Interpolation. In: Schrijvers, Tom and Thiemann, Peter, eds. Eleventh International Symposium on Functional and Logic Programming. Lecture Notes in Computer Science , 7294. pp. 182-196. Springer, Kobe, Japan (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:30816)

King, Andy, Mycroft, Alan, Simon, Axel, Reps, Tom (2012) Analysis of Executables: Benefits and Challenges. Dagstuhl Reports, 2 (1). pp. 100-116. ISSN 2192-5283. (doi:10.4230/DagRep.2.1.100) (KAR id:37628)

Kriener, Jael and King, Andy (2012) Mutual Exclusion by Interpolation: 11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012, Proceedings. In: Schrijvers, Tom and Thiemann, Peter, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 7294 . Springer, pp. 182-196. ISBN 978-3-642-29821-9. (doi:10.1007/978-3-642-29822-6_16) (KAR id:37588)

Kriener, Jael, King, Andy (2011) RedAlert: Determinacy Inference for Prolog. Theory and Practice of Logic Programming, 11 (4-5). pp. 182-196. (KAR id:30748)

Kriener, Jael, King, Andy (2011) Determinacy Inference for Prolog (appendix for conference submission). University of Kent, School of Computing, Canterbury, CT1 7NF, UK (KAR id:30760)

Kriener, Jael, King, Andy (2011) RedAlert: Determinacy Inference for Prolog. In: 27th International Conference on Logic Programming, July 6-10, 2011, LEXINGTON, KENTUCKY, USA. (KAR id:37621)

King, Andy and Sondergaard, Harald (2010) Automatic Abstraction for Congruences. In: Barthe, Gilles and Hermenegildo, Manuel V., eds. Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science (5944). Springer-Verlag, pp. 182-196. ISBN 978-3-642-11318-5. (KAR id:30704)

King, Andy (2008) Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry. In: Arenas, Puri and Zanardini, Damiano, eds. Proceedings on Logic-Based Methods in Programming Envrionments. . pp. 1-7. CoRR, Udine (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:24085)

Kettle, Neil, King, Andy (2008) An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27 (4). pp. 764-777. ISSN 0278-0070. (doi:10.1109/TCAD.2008.917592) (KAR id:37528)

King, Andy, ed. (2008) Logic-Based Program Synthesis and Transformation. Lecture Notes in Computer Science (4915). Springer-Verlag, 219 pp. ISBN 978-3-540-78768-6. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:23965)

Kettle, Neil (2008) Anytime algorithms for ROBDD symmetry detection and approximation. Doctor of Philosophy (PhD) thesis, University of Kent. (doi:10.22024/UniKent/01.02.86395) (KAR id:86395)

King, Andy and Sondergaard, Harald (2008) Inferring Congruence Equations using SAT: 20th International Conference, CAV 2008 Princeton, NJ, USA, July 7-14, 2008 Proceedings. In: Gupta, Aarti and Malik, Sharad, eds. Computer-Aided Verification. Lecture Notes in Computer Science, 5123 . Springer, pp. 281-293. ISBN 978-3-540-70543-7. (doi:10.1007/978-3-540-70545-1_26) (KAR id:37593)

Kettle, Neil, King, Andy (2006) Proof of New Decompositional Results for Generalized Symmetries (appendix for journal paper). University of Kent, School of Computing, University of Kent, Canterbury, Kent, CT2 7NF, 10 pp. (KAR id:14437)

Kettle, Neil, King, Andy (2006) Proof of New Implicational Relationships between Generalized Symmetries (appendix for journal paper). University of Kent, School of Computing, University of Kent, Canterbury, Kent, CT2 7NF, 11 pp. (KAR id:14501)

Kettle, Neil and King, Andy (2006) An Anytime Symmetry Detection Algorithm for ROBDDs. In: Onodera, H., ed. ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference. IEEE, pp. 243-248. ISBN 0-7803-9451-8. (doi:10.1145/1118299.1118364) (KAR id:37604)

King, Andy and Lu, Lunjin and Genaim, Samir (2006) Detecting Determinacy in Prolog Programs: 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006. Proceedings. In: Etalle, Sandro and Truszczynski, Mirek, eds. Logic Programming. Lecture Notes in Computer Science, 4079 . Springer, pp. 132-147. ISBN 978-3-540-36635-5. (doi:10.1007/11799573_12) (KAR id:37598)

Kettle, Neil and King, Andy and Strzemecki, Tadeusz (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, Holger and Palsberg, Jens, eds. Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, 3920 . Springer, pp. 105-119. ISBN 978-3-540-33056-1. (doi:10.1007/11691372_7) (KAR id:37603)

King, Andy, Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs (appendix for conference submission). University of Kent, School of Computing, University of Kent (KAR id:13989)

King, Andy and Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs: 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003. Proceedings. In: Palamidessi, Catuscia, ed. Logic Programming. Lecture Notes in Computer Science, 2916 . Springer, pp. 315-330. ISBN 978-3-540-20642-2. (doi:10.1007/978-3-540-24599-5_22) (KAR id:37611)

King, Andy, Lu, Lunjin (2002) A Backward Analysis for Constraint Logic Programs. Theory and Practice of Logic Programming, 2 (4-5). pp. 517-547. ISSN 1471-0684. (doi:10.1017/S1471068402001436) (KAR id:37580)

King, Andy, Lu, Lunjin (2001) A Backward Analysis for Constraint Logic Programs (appendix for journal paper). University of Kent, School of Computing, University of Kent at Canterbury, Kent, CT2 7NF, UK, 20 pp. (KAR id:13517)

King, Andy (2000) Pair-sharing over rational trees. Journal of Logic Programming, 46 (1-2). pp. 139-155. ISSN 0743-1066. (doi:10.1016/S0743-1066(00)00009-1) (KAR id:37582)

King, Andy and Smaus, Jan-Georg and Hill, Pat (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 22–28, 1999 Proceedings. In: Swierstra, Doaitse, ed. Programming Languages and Systems. Lecture Notes in Computer Science, 1576 . Springer, pp. 59-73. ISBN 978-3-540-65699-9. (doi:10.1007/3-540-49099-X_5) (KAR id:37618)

King, Andy, Bryans, Jeremy W. (1998) Using Probability to Reason about Soft Deadlines. University of Kent, School of Computing, 7 pp. (KAR id:21616)

King, Andy and Shen, Kish and Benoy, Florence (1997) Lower-bound Time-Complexity Analysis of Logic Programs. In: Maluszynski, Jan, ed. Proceedings of the 1996 International Symposium. Logic Programming . MIT Press, Cambridge, Massachusetts, USA, pp. 261-276. ISBN 0-262-63180-6. (KAR id:21434)

King, Andy, Longley, Mark (1995) Abstract Matching Can Improve on Abstract Unification. University of Kent, School of Computing, University of Kent, Canterbury, UK (KAR id:21270)

King, Andy (1995) Share x Free Revisited. University of Kent, School of Computing, University of Kent, Canterbury, UK (KAR id:21294)

Kemp, Bob and King, Andy and Soper, Paul (1994) Continuation Compilation for Concurrent Logic Programming. In: Crespo, Alfons, ed. Symposium on Artificial Intelligence in Real-time Control. Pergamon, pp. 299-306. ISBN 0-08-042236-5. (doi:10.1016/0066-4138(94)90082-5) (KAR id:21172)

King, Andy and Soper, Paul (1994) Depth-k Sharing and Freeness. In: Van Hentenryck, Pascal, ed. Proceedings of the Eleventh International Conference on Logic Programming. Logic Programming . MIT Press, Cambridge, Massachusetts, USA, pp. 553-568. ISBN 0-262-72022-1. (KAR id:21207)

King, Andy (1994) A Synergistic Analysis for Sharing and Groundness which traces Linearity. In: Sannella, Don, ed. Programming Languages and Systems — ESOP '94 5th European Symposium on Programming. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 363-378. ISBN 978-3-540-57880-2. E-ISBN 978-3-540-48376-2. (doi:10.1007/3-540-57880-3_24) (KAR id:21205)

King, Andy (1994) A Framework for Freeness Analysis. In: Tick, Evan and Succi, G., eds. Implementations of Logic Programming Systems. Implementations of Logic Programming Systems . Kluwer Academic Publishers, Dordrecht, pp. 137-149. ISBN 0-7923-9457-7. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:21148)

King, Andy (1994) High Precision Sharing Analysis. Journal of Programming Languages, 2 (1). pp. 149-191. ISSN 0963-9306. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:37587)

King, Andy and Soper, Paul (1992) Schedule Analysis of Concurrent Logic Programs. In: Apt, Krzysztof, ed. Joint International Conference and Symposium for Logic Programming. Logic Programming . MIT Press, USA, pp. 478-492. ISBN 978-0-262-51064-6. (KAR id:20891)

King, Andy and Soper, Paul (1992) Serialisation Analysis of Concurrent Logic Programs. In: Kirchner, Hélène and Levi, Giorgio, eds. Algebraic and Logic Programming. Lecture Notes in Computer Science, 632 . Springer, pp. 322-334. ISBN 3-540-55873-X. (KAR id:21031)

King, Andy and Soper, Paul (1992) Ordering Optimizations for Concurrent Logic Programs. In: Nerode, Anil and Taitslin, Michael, eds. Logical Foundations of Computer Science. Lecture Notes in Computer Science, 620 . Springer, pp. 221-228. ISBN 978-3-540-55707-4. E-ISBN 978-3-540-47276-6. (doi:10.1007/BFb0023876) (KAR id:37629)

King, Andy and Soper, Paul (1991) Reducing Scheduling Overheads for Concurrent Logic Programs. In: Boley, Harold and Richter, Michael, eds. Processing Declarative Knowledge. Lecture Notes in Artificial Intelligence (567). Springer-Verlag, pp. 279-286. ISBN 3-540-55033-X. (KAR id:20996)

L

Li, Xuan, King, Andy, Lu, Lunjin (2006) Correctness of Closure Collapsing (appendix to conference submission). Lecture Notes in Computer Science, 4079/2. Report number: 10.1007/11799573_13. University of Kent, School of Computing, University of Kent, Canterbury, CT2 7NF ISBN 978-3-540-36635-5. (doi:10.1007/11799573_13) (KAR id:14487)

Li, Xuan and King, Andy and Lu, Lunjin (2006) Collapsing Closures: 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006. Proceedings. In: Etalle, Sandro and Truszczynski, Mirek, eds. Logic Programming. Lecture Notes in Computer Science, 4079 . Springer, pp. 148-162. ISBN 978-3-540-36635-5. (doi:10.1007/11799573_13) (KAR id:37601)

Li, Xuan and King, Andy and Lu, Lunjin (2006) Lazy Set-Sharing Analysis: 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006. Proceedings. In: Wadler, Philip and Hagiya, Masimi, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 3945 . Springer, pp. 177-191. ISBN 978-3-540-33438-5. (doi:10.1007/11737414_13) (KAR id:37602)

Lu, Lunjin and King, Andy (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, Shmuel, ed. European Symposium on Programming. Lecture Notes in Computer Science, 3444 . Springer, pp. 108-123. ISBN 978-3-540-25435-5. (doi:10.1007/978-3-540-31987-0_9) (KAR id:37607)

Lu, Lunjin and King, Andy (2004) Backward Pair Sharing Analysis: 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004. Proceedings. In: Kameyama, Yukiyoshi and Stuckey, Peter, eds. Functional and Logic Programming. Lecture Notes in Computer Science . Springer, pp. 132-146. ISBN 978-3-540-21402-1. (doi:10.1007/978-3-540-24754-8_11) (KAR id:37610)

Lu, Lunjin and King, Andy (2002) Backward Type Inference Generalises Type Checking. In: Hermenegildo, Manuel V. and Puebla, German, eds. Static Analysis 9th International Symposium. Lecture Notes in Computer Science, 2477 . Springer, Berlin, Germany, pp. 85-101. ISBN 978-3-540-44235-6. E-ISBN 978-3-540-45789-3. (doi:10.1007/3-540-45789-5_9) (KAR id:13743)

M

Macintyre-Randall, Sadie (2023) Enforcing C++ type integrity with fast dynamic casting, member function protections and an exploration of C++ beneath the surface. Doctor of Philosophy (PhD) thesis, University of Kent,. (doi:10.22024/UniKent/01.02.102955) (KAR id:102955)

Martin, Jonthan C. and King, Andy (2004) On the Inference of Natural Level Mappings: A Decade of Research Advances in Logic-Based Program Development. In: Bruynooghe, Maurice and Lau, Kung-Kiu, eds. Program Development in Computational Logic,. Lecture Notes in Computer Science, 3049 . Springer, pp. 432-452. ISBN 978-3-540-22152-4. (doi:10.1007/978-3-540-25951-0_13) (KAR id:37609)

Martin, Jonthan C. and King, Andy (1997) Generating Efficient, Terminating Logic Programs. In: Bidoit, Michel and Dauchet, Max, eds. Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development. Lecture Notes in Computer Science, 1214 . Springer Verlag, pp. 173-184. ISBN 3-540-62781-2. (KAR id:21517)

Martin, Jon and King, Andy (1996) Typed Norms for Typed Logic Programs. In: Gallagher, John, ed. Logic Program Synthesis and Transformation. Lecture Notes in Computer Science, 1207 . Springer-Verlag, pp. 224-238. ISBN 3-540-62718-9. (doi:10.1007/3-540-62718-9_13) (KAR id:21467)

O

Okudono, Takamasa and King, Andy (2020) Mind the Gap: Bit-vector Interpolation recast over Linear Integer Arithmetic. In: Biere, Armin and Parker, David, eds. International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, pp. 79-96. ISBN 978-3-030-45189-9. (doi:10.1007/978-3-030-45190-5_5) (KAR id:80188)

R

Robbins, Ed, King, Andy, Howe, Jacob M. (2020) Backjumping is Exception Handling. Theory and Practice of Logic Programming, . pp. 1-20. ISSN 1471-0684. (doi:10.1017/S1471068420000435) (KAR id:82447)

Robbins, Ed (2017) Solvers for Type Recovery and Decompilation of Binaries. Doctor of Philosophy (PhD) thesis, University of Kent,. (KAR id:61349)

Robbins, Edward, King, Andy, Schrijvers, Tom (2016) From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes. In: Guha, Arjun and Chong, Steve, eds. POPL '16. . pp. 191-203. ACM Press, St. Petersburg, Florida, USA ISBN 978-1-4503-3549-2. (doi:10.1145/2837614.2837633) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:51097)

Robbins, Ed, King, Andy, Schrijvers, Tom (2015) Benchmarks, assembly files, and witnesses. On-line. Located at: On-line. (KAR id:51448)

Robbins, Ed, King, Andy, Schrijvers, Tom (2015) Proof appendix to accompany the paper, "From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes". University of Kent (KAR id:51459)

Robbins, Ed, Howe, Jacob M., King, Andy (2015) Theory Propagation and Reification. Science of Computer Programming, 111 (1). pp. 3-22. ISSN 0167-6423. (doi:10.1016/j.scico.2014.05.013) (KAR id:37600)

Robbins, Ed and Howe, Jacob M. and King, Andy (2013) Theory Propagation and Rational-Trees. In: Schrijvers, Tom, ed. Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming. PPDP Principles and Practice of Declarative Programming . ACM, New York, USA, pp. 193-204. ISBN 978-1-4503-2154-9. (doi:10.1145/2505879.2505901) (KAR id:37525)

S

Seed, Thomas and King, Andy and Evans, Neil (2020) Reducing Bit-Vector Polynomials to SAT using Gröbner Bases. In: Pulina, Lusa and Martina, Seidl, eds. The 23rd International Conference on Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science, 12178 . Springer, pp. 361-377. ISBN 978-3-030-51824-0. E-ISBN 978-3-030-51825-7. (doi:10.1007/978-3-030-51825-7) (KAR id:81001)

Singh, Ranjeet and King, Andy (2015) Partial Evaluation for Java Malware Detection. In: Proietti, Maurizio and Seki, Hirohisa, eds. Twenty fourth International Symposium on Logic-Based Program Synthesis and Transformation. Lecture Notes in Computer Science, 8991 . Springer, pp. 133-147. ISBN 978-3-319-17821-9. E-ISBN 978-3-319-17822-6. (doi:10.1007/978-3-319-17822-6_8) (KAR id:42104)

Simon, Axel, King, Andy, Howe, Jacob M. (2010) The Two Variable Per Inequality Abstract Domain. Higher-Order and Symbolic Computation, 31 (1). pp. 182-196. (doi:10.1007/s10990-010-9062-8) (KAR id:30678)

Simon, Axel and King, Andy (2007) Taming the Wrapping of Integer Arithmetic. In: File, Gilberto and Nielson, Hanne Riis, eds. Static Analysis Symposium 14th International Symposium. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 182-196. ISBN 978-3-540-74060-5. E-ISBN 978-3-540-74061-2. (doi:10.1007/978-3-540-74061-2_8) (KAR id:37594)

Simon, Axel and King, Andy (2007) Widening Polyhedra with Landmarks: 4th Asian Symposium, APLAS 2006, Sydney, Australia, November 8-10, 2006. Proceedings. In: Kobayashi, Naoki, ed. Asian Symposium on Programming Languages and Systems. Lecture Notes in Computer Science, 4279 . Springer, pp. 166-182. ISBN 978-3-540-48937-5. (doi:10.1007/11924661_11) (KAR id:37597)

Simon, Axel and King, Andy (2005) Exploiting Sparsity in Polyhedral Analysis: 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005. Proceedings. In: Hankin, Chris and Siveroni, Igor, eds. Static Analysis Symposium. Lecture Notes in Computer Science, 3672 . Springer, pp. 336-351. ISBN 978-3-540-28584-7. (doi:10.1007/11547662_23) (KAR id:37606)

Simon, Axel and King, Andy (2002) Analyzing String Buffers in C. In: Kirchner, Hélène and Ringeissen, Christophe, eds. International Conference on Algebraic Methodology and Software Technology. Lecture Notes in Computer Science, 2422 . Springer, pp. 365-379. ISBN 3-540-44144-1. (doi:10.1007/3-540-45719-4_25) (KAR id:13750)

Simon, Axel and King, Andy and Howe, Jacob M. (2002) Two Variables per Linear Inequality as an Abstract Domain. In: Leuschel, Michael, ed. Logic Based Program Synthesis and Transformation 12th International Workshop. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 71-89. ISBN 978-3-540-40438-5. E-ISBN 978-3-540-45013-9. (doi:10.1007/3-540-45013-0_7) (KAR id:13681)

Smaus, Jan-Georg, Hill, Pat, King, Andy (2001) Verifying termination and error-freedom of logic programs with block declarations. Theory and Practice of Logic Programming, 1 (4). pp. 447-486. ISSN 1471-0684. (doi:10.1017/S1471068401001107) (KAR id:37581)

Smaus, Jan-Georg and Hill, Pat and King, Andy (1999) Mode Analysis Domains for Typed Logic Programs. In: Bossi, Annalisa, ed. Logic-Based Program Synthesis and Transformation 9th International Workshop. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 82-101. ISBN 978-3-540-67628-7. E-ISBN 978-3-540-45148-8. (doi:10.1007/10720327_6) (KAR id:22064)

Shen, Kish, Santos Costa, Vitor, King, Andy (1999) Distance: a New Metric for Controlling Granularity for Parallel Execution. Journal of Functional and Logic Programming, 1999 . pp. 1-23. ISSN 1080-5230. (KAR id:37585)

Shen, Kish and Costa, Vitor Santos and King, Andy (1998) Distance: a New Metric for Controlling Granularity for Parallel Execution. In: Jaffar, Joxan, ed. Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming. Logic Programming . MIT Press, Cambridge, Massachusetts, USA, pp. 85-99. ISBN 0-262-60031-5. (KAR id:21639)

Smaus, Jan-Georg and Hill, Pat and King, Andy (1998) Preventing Instantiation Errors and Loops for Logic Programs with Several Modes Using block Declarations. In: Flener, Pierre, ed. Logic Programming, Synthesis and Transformation. Lecture Notes in Computer Science, 1559 . Springer, pp. 182-196. ISBN 3-540-65765-7. (KAR id:21649)

Smaus, Jan-Georg and Hill, Pat and King, Andy (1998) Termination of Logic Programs with block Declarations Running in Several Modes. In: Palamidessi, Catuscia, ed. International Symposium on Programming Languages: Implementations, Logics and Programs. Lecture Notes in Computer Science, 1490 . Springer-Verlag, see also http://www.springer.de/comp/lncs/index.html, pp. 182-196. ISBN 3-540-65012-1. (KAR id:21647)