Browse by Person (creator, editor, contributor, etc.)

Group by: Item Type | Date | No Grouping

Number of items: 121.

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

Preview

Preview

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

Preview

Chawdhary, Aziem and King, Andy (2018) Closing the Performance Gap between Doubles and Rationals for Octagons. In: Podelski, Andreas, ed. Static Analysis 25th International Symposium. Springer. ISBN 978-3-319-99724-7. (doi:https://doi.org/10.1007/978-3-319-99725-4_13) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Chawdhary, Aziem and Robbins, Ed and King, Andy (2018) Incrementally Closing Octagons. Formal Methods in System Design, . ISSN 0925-9856. E-ISSN 1572-8102. (doi:https://doi.org/10.1007/s10703-017-0314-7) (Full text available)

Preview

Preview

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:https://doi.org/10.1007/978-3-319-71237-6_23) (Full text available)

Preview

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:https://doi.org/10.1145/3131851.3131861) (Full text available)

Preview

Chawdhary, Aziem and King, Andy and Singh, Ranjeet (2017) Partial Evaluation of String Obfuscations for Java Malware Detection. Formal Aspects of Computing, 29 (1). ISSN 0934-5043. E-ISSN 1433-299X. (doi:https://doi.org/10.1007/s00165-016-0357-3) (Full text available)

Preview

Robbins, Ed (2017) Solvers for Type Recovery and Decompilation of Binaries. Doctor of Philosophy (PhD) thesis, University of Kent,. (Full text available)

Preview

Jones, William and Chawdhary, Aziem and King, Andy (2016) Optimising the Volgenant-Jonker Algorithm for Approximating Graph Edit Distance. Pattern Recognition Letters, . pp. 1-9. ISSN 0167-8655. (doi:https://doi.org/10.1016/j.patrec.2016.07.024) (Full text available)

Preview

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:https://doi.org/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)

Robbins, Ed and King, Andy and Schrijvers, Tom (2016) From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes. In: Guha, Arjun and Chong, Steve, eds. Symposium on Principles of Programming Languages. ACM Press, St. Petersburg, Florida, USA, pp. 191-203. (doi:https://doi.org/10.1145/2837614.2837633) (Full text available)

Preview

Robbins, Ed and King, Andy and Schrijvers, Tom (2015) Benchmarks, assembly files, and witnesses. On-line. Located at: On-line. (Full text available)

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

Preview

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

Preview

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:https://doi.org/10.1007/978-3-319-17822-6_8) (Full text available)

Preview

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:https://doi.org/10.1007/978-3-319-18224-7) (Full text available)

Preview

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:https://doi.org/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)

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. (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

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)

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

Preview

Bourquin, Martial and King, Andy and Robbins, Ed (2013) BinSlayer: Accurate Comparison of Binary Executables. In: PPREW '13. Proceedings of the 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop. ACM, New York ISBN 978-1-4503-1857-0. (doi:https://doi.org/10.1145/2430553.2430557) (Full text available)

Preview

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:https://doi.org/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)

Robbins, Ed and King, Andy and Jacob, Howe (2013) Theory Propagation and Rational-Trees. In: Schrijvers, Tom, ed. Principles and Practice of Declarative Programming. ACM Press, New York, pp. 193-204. ISBN 978-1-4503-2154-9. (doi:https://doi.org/10.1145/2505879.2505901) (Full text available)

Preview

Barrett, Edd and 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:https://doi.org/10.1016/j.entcs.2010.09.003) (Full text available)

Preview

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. (Full text available)

Preview

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. (Full text available)

Preview

Brauer, Jorg and King, Andy (2012) Transfer Function Synthesis without Quantifier Elimination (long version). Logical Methods in Computer Science, 8 (2012). (Full text available)

Preview

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

Preview

Kriener, Jael and 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. Springer, Kobe, Japan pp. 182-196. (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)

King, Andy and Mycroft, Alan and Simon, Axel and Reps, Tom (2012) Analysis of Executables: Benefits and Challenges. In: Dagstuhl Reports. pp. 100-116. (doi:https://doi.org/10.4230/DagRep.2.1.100) (Full text available)

Preview

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 (Full text available)

Preview

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:https://doi.org/10.1007/978-3-642-29822-6_16) (Full text available)

Preview

De Schreye, Danny and Janssens, Gerda (2012) PPDP '12 Proceedings of the 14th symposium on Principles and practice of declarative programming. In: De Schreye, Danny and Janssens, Gerda and King, Andy, eds. PPDP'12. ACM Press 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)

Brauer, Jorg and King, Andy and Kriener, Jael (2011) Existential Quantification as Incremental SAT. In: Gopalakrishnan, Ganesh and Qadeer, Shaz, eds. Twenty Third International Conference on Computer Aided Verification. Lecture Notes in Computer Science. Springer-Verlag pp. 182-196. (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)

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

Preview

Kriener, Jael and King, Andy (2011) Determinacy Inference for Prolog (appendix for conference submission). University of Kent, School of Computing, Canterbury, CT1 7NF, UK (Full text available)

Preview

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. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2011) A Pearl on SAT Solving in Prolog (Logic Programming Newsletter). Logic Programming Newsletter, 2011 (3). pp. 182-196. (Full text available)

Preview

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. (Full text available)

Preview

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, pp. 191-207. ISBN 978-3-642-22109-5. (doi:https://doi.org/10.1007/978-3-642-22110-1_17) (Full text available)

Preview

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

Preview

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

Preview

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. (Full text available)

Preview

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. (Full text available)

Preview

Simon, Axel and King, Andy and Howe, Jacob M. (2010) The Two Variable Per Inequality Abstract Domain. Higher-Order and Symbolic Computation, 31 (1). pp. 182-196. (Full text available)

Preview

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. (Full text available)

Preview

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:https://doi.org/10.1007/978-3-642-15898-8_6) (Full text available)

Preview

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:https://doi.org/10.1007/978-3-642-02158-9_9) (Full text available)

Preview

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:https://doi.org/10.1007/978-3-642-04761-9_23) (Full text available)

Preview

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. CoRR, Udine pp. 1-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)

Genaim, Samir and 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:https://doi.org/10.1145/1352582.1352585) (Full text available)

Preview

Kettle, Neil and 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:https://doi.org/10.1109/TCAD.2008.917592) (Full text available)

Preview

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)

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:https://doi.org/10.1007/978-3-540-70545-1_26) (Full text available)

Preview

Simon, Axel and King, Andy (2007) Taming the Wrapping of Integer Arithmetic: 14th International Symposium, SAS 2007, Kongens Lyngby, Denmark, August 22-24, 2007. Proceedings. In: File, Gilberto and Nielson, Hanne Riis, eds. Static Analysis Symposium. Lecture Notes in Computer Science, 4634 . Springer, pp. 182-196. ISBN 978-3-540-74060-5. (doi:https://doi.org/10.1007/978-3-540-74061-2_8) (Full text available)

Preview

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:https://doi.org/10.1007/11924661_11) (Full text available)

Preview

Kettle, Neil and 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. (Full text available)

Preview

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

Preview

Kettle, Neil and 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. (Full text available)

Preview

Kettle, Neil and King, Andy (2006) An Anytime Symmetry Detection Algorithm for ROBDDs. In: Onodera, H., ed. Asia and South Pacific Design Automation Conference. IEEE Press, pp. 243-248. ISBN 0-7803-9451-8. (doi:https://doi.org/10.1145/1118299.1118364) (Full text available)

Preview

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:https://doi.org/10.1007/11799573_13) (Full text available)

Preview

Jonathan, Martin and King, Andy (2006) Control Generation by Program Transformation. Fundamenta informaticae, 69 (1-2). pp. 179-218. ISSN 0169-2968. E-ISSN 1875-8681. (Full text available)

Preview

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:https://doi.org/10.1007/11799573_12) (Full text available)

Preview

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:https://doi.org/10.1007/11737414_13) (Full text available)

Preview

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:https://doi.org/10.1007/11691372_7) (Full text available)

Preview

Benoy, Florence and King, Andy and 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:https://doi.org/10.1017/S1471068404002261) (Full text available)

Preview

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:https://doi.org/10.1007/978-3-540-31987-0_9) (Full text available)

Preview

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:https://doi.org/10.1007/11547662_23) (Full text available)

Preview

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:https://doi.org/10.1007/978-3-540-25951-0_6) (Full text available)

Preview

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:https://doi.org/10.1007/978-3-540-24754-8_11) (Full text available)

Preview

Simon, Axel and King, Andy (2004) Convex Hull for Planar H-Polyhedra. International Journal of Computer Mathematics, 81 (3). pp. 259-271. ISSN 0020-7160. (doi:https://doi.org/10.1080/00207160310001650034) (Full text available)

Preview

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:https://doi.org/10.1007/978-3-540-25951-0_13) (Full text available)

Preview

King, Andy and Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs (appendix for conference submission). University of Kent, School of Computing, University of Kent (Full text available)

Preview

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

Preview

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

Preview

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:https://doi.org/10.1007/978-3-540-24599-5_22) (Full text available)

Preview

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:https://doi.org/10.1007/3-540-36575-3_7) (Full text available)

Preview

Lu, Lunjin and King, Andy (2002) Backward Type Inference Generalises Type Checking. In: Hermenegildo, Manuel V. and Puebla, German, eds. Static Analysis Symposium. Lecture Notes in Computer Science, 2477 . Springer-Verlag, Berlin, pp. 85-101. ISBN 978-3-540-44235-6. (doi:https://doi.org/10.1007/3-540-45789-5_9) (Full text available)

Preview

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:https://doi.org/10.1007/3-540-45719-4_25) (Full text available)

Preview

King, Andy and 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:https://doi.org/10.1017/S1471068402001436) (Full text available)

Preview

Howe, Jacob M. and King, Andy (2002) Correctness of Set-Sharing with Linearity. University of Kent, School of Computing, Canterbury, 5 pp. (Full text available)

Preview

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. Lecture Notes in Computer Science, 2664 . Springer-Verlag, Berlin, pp. 71-89. ISBN 978-3-540-40438-5. (doi:https://doi.org/10.1007/3-540-45013-0_7) (Full text available)

Preview

King, Andy and 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. (Full text available)

Preview

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:https://doi.org/10.1007/3-540-45635-X_16) (Full text available)

Preview

Smaus, Jan-Georg and Hill, Pat and 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:https://doi.org/10.1017/S1471068401001107) (Full text available)

Preview

Howe, Jacob M. and King, Andy (2001) Widening BDDs. University of Kent, School of Computing, 9 pp. (Full text available)

Preview

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

Preview

Heaton, Andrew and Abo-Zaed, Mohammad and King, Andy and 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:https://doi.org/10.1016/S0743-1066(00)00006-6) (Full text available)

Preview

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

Preview

Heaton, Andrew and King, Andy (2000) Abstracting Builtins for Groundness Analysis. University of Kent, School of Computing, Computing Laboratory, 8 pp. (Full text available)

Preview

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:https://doi.org/10.1007/3-540-46425-5_10) (Full text available)

Preview

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:https://doi.org/10.1007/3-540-46425-5_13) (Full text available)

Preview

Howe, Jacob M. and 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. (Full text available)

Preview

Benoy, Florence and King, Andy (1999) An Isomorphism between Abstract Polyhedral Cones and Definite Boolean Functions. University of Kent, School of Computing, University of Kent, 21 pp. (Full text available)

Preview

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. (Full text available)

Preview

Smaus, Jan-Georg and Hill, Pat and King, Andy (1999) Mode Analysis Domains for Typed Logic Programs. In: Bossi, Annalisa, ed. Logic Programming, Synthesis and Transformation. Lecture Notes in Computer Science, 1817 . Springer-Verlag, pp. 82-101. ISBN 3-540-67628-7. (Full text available)

Preview

Shen, Kish and Santos Costa, Vitor and 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. (Full text available)

Preview

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:https://doi.org/10.1007/3-540-49099-X_5) (Full text available)

Preview

King, Andy and Bryans, Jeremy W. (1998) Using Probability to Reason about Soft Deadlines. University of Kent, School of Computing, 7 pp. (Full text available)

Preview

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:https://doi.org/10.1007/3-540-49674-2_8) (Full text available)

Preview

Shen, Kish and Costa, Vitor Santos and King, Andy (1998) Distance: a New Metric for Controlling Granularity for Parallel Execution. In: Jaffar, Joxan, ed. Joint International Conference and Symposium for Logic Programming. MIT Press, pp. 85-99. ISBN 0-262-60031-5. (Full text available)

Preview

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. (Full text available)

Preview

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. (Full text available)

Preview

Hill, Pat and 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)

King, Andy and Shen, Kish and Benoy, Florence (1997) Lower-bound Time-Complexity Analysis of Logic Programs. In: Maluszynski, Jan, ed. International Symposium on Logic programming. MIT Press, pp. 261-276. ISBN 0-262-63180-6. (Full text available)

Preview

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. (Full text available)

Preview

Hill, Pat and King, Andy (1997) Determinacy and Determinacy Analysis. Journal of Programming Languages, 5 (1). pp. 135-171. ISSN 0963-9306. (Full text available)

Preview

Benoy, Florence and King, Andy (1996) Inferring Argument Size Relationships with CLP(R). In: Gallagher, John, ed. Logic Programming Synthesis and Transformation. Lecture Notes in Computer Science, 1207 . Springer-Verlag, pp. 204-223. ISBN 3-540-62718-9. (Full text available)

Preview

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:https://doi.org/10.1007/3-540-62718-9_13) (Full text available)

Preview

King, Andy and Longley, Mark (1995) Abstract Matching Can Improve on Abstract Unification. University of Kent, School of Computing, University of Kent, Canterbury, UK (Full text available)

Preview

King, Andy (1995) Share x Free Revisited. University of Kent, School of Computing, University of Kent, Canterbury, UK (Full text available)

Preview

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. (Full text available)

Preview

King, Andy and Soper, Paul (1994) Depth-k Sharing and Freeness. In: Van Hentenryck, Pascal, ed. International Conference on Logic Programming. MIT Press Series in Logic Programming . MIT Press, pp. 553-568. ISBN 0-262-72022-1. (Full text available)

Preview

King, Andy (1994) A Synergistic Analysis for Sharing and Groundness which traces Linearity. In: Sannella, Don, ed. European Symposium on Programming. Lecture Notes in Computer Science, 788 . Springer-Verlag, pp. 363-378. ISBN 3-540-57880-3. (Full text available)

Preview

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)

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)

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. (Full text available)

Preview

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. (Full text available)

Preview

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:https://doi.org/10.1007/BFb0023876) (Full text available)

Preview

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:https://doi.org/10.1007/978-3-642-32469-7_7) (Full text available)

Preview

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. (Full text available)

Preview

This list was generated on Mon May 27 16:59:52 2019 BST.

Export as	Atom RSS 1.0 RSS 2.0