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

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 107.

Article

Kriener, Jael and King, Andy and Blazy, Sandrine (2014) Proofs You Can Believe In: Proving Equivalences Between Prolog Semantics in Coq (long version). Science of Computer Programming . ISSN 0167-6423. (Submitted) (Full text available)
[img]
Preview

Robbins, Ed and Howe, Jacob M. and King, Andy (2014) Theory Propagation and Reification. Science of Computer Programming . ISSN 0167-6423. (In press) (Access to this publication is restricted)
[img]

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. (Full text available)
[img]
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. (Full text available)
[img]
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)
[img]
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. (Full text available)
[img]
Preview

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)
[img]
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)
[img]
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. (Full text available)
[img]
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)
[img]
Preview

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. (Full text available)
[img]
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. (Full text available)
[img]
Preview

Jonathan, Martin and King, Andy (2006) Control Generation by Program Transformation. Fundamenta informaticae, 69 (1-2). pp. 179-218. ISSN 0169-2968. (Full text available)
[img]
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. (Full text available)
[img]
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. (Full text available)
[img]
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. (Full text available)
[img]
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. (Full text available)
[img]
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. (Full text available)
[img]
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. (Full text available)
[img]
Preview

King, Andy (2000) Pair-sharing over rational trees. Journal of Logic Programming, 46 (1-2). pp. 139-155. ISSN 0743-1066. (Full text available)
[img]
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. (Full text available)
[img]
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. (Full text available)
[img]
Preview
[img]

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)
[img]
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 available from this repository)

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)
[img]
Preview

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 available from this repository)

Book section

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 . Springer, pp. 1-18. (In press) (Access to this publication is restricted)
[img]

Singh, Ranjeet and King, Andy (2014) 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 . Springer. (In press) (Full text available)
[img]
Preview

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, pp. 270-284. ISBN 9783319071510. (Full text available)
[img]
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)
[img]
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)
[img]
Preview

Kriener, Jael and King, Andy (2012) Mutual Exclusion by Interpolation. In: Schrijvers, Tom and Thiemann, Peter, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 7294 . Springer, pp. 182-196. ISBN 9783642298219. (Full text available)
[img]
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)
[img]
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)
[img]
Preview

Brauer, Jorg and King, Andy and Kriener, Jael (2011) Existential Quantification as Incremental SAT. In: Gopalakrishnan, Ganesh and Qadeer, Shaz, eds. Computer Aided Verification. Lecture Notes in Computer Science, 6806 . Springer, pp. 191-207. ISBN 9783642221095. (Full text available)
[img]
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)
[img]
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)
[img]
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)
[img]
Preview

Brauer, Jorg and King, Andy and Kowalewski, Stefan (2010) Range Analysis of Microcontroller Code Using Bit-Level Congruences. In: Kowalewski, Stefan and Roveri, Marco, eds. Formal Methods for Industrial Critical Systems. Lecture Notes in Computer Science, 6371 . Springer, pp. 82-98. ISBN 9783642158971. (Full text available)
[img]
Preview

Charles, Philip and King, Andy and Howe, Jacob M. (2009) Integer Polyhedra for Program Analysis. In: Goldberg, Andrew and Zhou, Yunhong, eds. Algorithmic Aspects in Information and Management,. Lecture Notes in Computer Science, 5564 . Springer, pp. 85-99. ISBN 9783642021572. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2009) Logahedra: a New Weakly Relational Domain. In: Zhiming, Lu and Anders, Ravn, eds. Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, 5799 . Springer, pp. 306-320. ISBN 9783642047602. (Full text available)
[img]
Preview

King, Andy and Sondergaard, Harald (2008) Inferring Congruence Equations using SAT. In: Gupta, Aarti and Malik, Sharad, eds. Computer-Aided Verification. Lecture Notes in Computer Science, 5123 . Springer, pp. 281-293. ISBN 9783540705437. (Full text available)
[img]
Preview

Simon, Axel and King, Andy (2007) Taming the Wrapping of Integer Arithmetic. In: File, Gilberto and Nielson, Hanne Riis, eds. Static Analysis Symposium. Lecture Notes in Computer Science, 4634 . Springer, pp. 182-196. ISBN 9783540740605. (Full text available)
[img]
Preview

Simon, Axel and King, Andy (2007) Widening Polyhedra with Landmarks. In: Kobayashi, Naoki, ed. Asian Symposium on Programming Languages and Systems. Lecture Notes in Computer Science, 4279 . Springer, pp. 166-182. ISBN 9783540489375. (Full text available)
[img]
Preview

Li, Xuan and King, Andy and Lu, Lunjin (2006) Collapsing Closures. In: Etalle, Sandro and Truszczynski, Mirek, eds. Logic Programming. Lecture Notes in Computer Science, 4079 . Springer, pp. 148-162. ISBN 9783540366355. (Full text available)
[img]
Preview

King, Andy and Lu, Lunjin and Genaim, Samir (2006) Detecting Determinacy in Prolog Programs. In: Etalle, Sandro and Truszczynski, Mirek, eds. Logic Programming. Lecture Notes in Computer Science, 4079 . Springer, pp. 132-147. ISBN 9783540366355. (Full text available)
[img]
Preview

Li, Xuan and King, Andy and Lu, Lunjin (2006) Lazy Set-Sharing Analysis. In: Wadler, Philip and Hagiya, Masimi, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 3945 . Springer, pp. 177-191. ISBN 9783540334385. (Full text available)
[img]
Preview

Kettle, Neil and King, Andy and Strzemecki, Tadeusz (2006) Widening ROBDDs with Prime Implicants. 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 9783540330561. (Full text available)
[img]
Preview

Lu, Lunjin and King, Andy (2005) Determinacy Inference for Logic Programs. In: Sagiv, Shmuel, ed. European Symposium on Programming. Lecture Notes in Computer Science, 3444 . Springer, pp. 108-123. ISBN 9783540254355. (Full text available)
[img]
Preview

Simon, Axel and King, Andy (2005) Exploiting Sparsity in Polyhedral Analysis. In: Hankin, Chris and Siveroni, Igor, eds. Static Analysis Symposium. Lecture Notes in Computer Science, 3672 . Springer, pp. 336-351. ISBN 9783540285847. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy and Lu, Lunjin (2004) Analysing Logic Programs by Reasoning Backwards. In: Bruynooghe, Maurice and Lau, Kung-Kiu, eds. Program Development in Computational Logic. Lecture Notes in Computer Science, 3049 . Springer, pp. 152-188. ISBN 9783540221524. (Full text available)
[img]
Preview

Lu, Lunjin and King, Andy (2004) Backward Pair Sharing Analysis. In: Kameyama, Yukiyoshi and Stuckey, Peter, eds. Functional and Logic Programming. Lecture Notes in Computer Science . Springer, pp. 132-146. ISBN 9783540214021. (Full text available)
[img]
Preview

Martin, Jonthan C. and King, Andy (2004) On the Inference of Natural Level Mappings. In: Bruynooghe, Maurice and Lau, Kung-Kiu, eds. Program Development in Computational Logic,. Lecture Notes in Computer Science, 3049 . Springer, pp. 432-452. ISBN 9783540221524. (Full text available)
[img]
Preview

King, Andy and Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs. In: Palamidessi, Catuscia, ed. Logic Programming. Lecture Notes in Computer Science, 2916 . Springer, pp. 315-330. ISBN 9783540206422. (Full text available)
[img]
Preview

Genaim, Samir and King, Andy (2003) Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. In: Degano, Pierpaolo, ed. European Symposium on Programming. Lecture Notes in Computer Science . Springer, pp. 84-98. ISBN 9783540008866. (Full text available)
[img]
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. (Full text available)
[img]
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. (Full text available)
[img]
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. (Full text available)
[img]
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. (Full text available)
[img]
Preview

Heaton, Andrew and Hill, Pat and King, Andy (2000) Abstract Domains for Universal and Existential Properties. In: Smolka, Gert, ed. Programming Languages and Systems. Lecture Notes in Computer Science, 1782 . Springer, pp. 150-164. ISBN 9783540672623. (Full text available)
[img]
Preview

Howe, Jacob M. and King, Andy (2000) Implementing Groundness Analysis with Definite Boolean Functions. In: Smolka, Gert, ed. European Symposium on Programming. Lecture Notes in Computer Science, 1782 . Springer, pp. 200-214. ISBN 9783540672623. (Full text available)
[img]
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)
[img]
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)
[img]
Preview

King, Andy and Smaus, Jan-Georg and Hill, Pat (1999) Quotienting Share for Dependency Analysis. In: Swierstra, Doaitse, ed. Programming Languages and Systems. Lecture Notes in Computer Science, 1576 . Springer, pp. 59-73. ISBN 9783540656999. (Full text available)
[img]
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. (Full text available)
[img]
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)
[img]
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)
[img]
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)
[img]
Preview

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)
[img]
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)
[img]
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)
[img]
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 . (Full text available)
[img]
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)
[img]
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)
[img]
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)
[img]
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 available from this repository)

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 9780262510646. (Full text available)
[img]
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)
[img]
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 9783540557074. (Full text available)
[img]
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. (Full text available)
[img]
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)
[img]
Preview

Monograph

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)
[img]
Preview

Conference or workshop item

Bourquin, Martial and King, Andy and Robbins, Ed (2013) BinSlayer: Accurate Comparison of Binary Executables. In: 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop, January 26, 2013, Rome, Italy. (Full text available)
[img]
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 9781450321549. (Full text available)
[img]
Preview

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 9781450321549. (Full text available)
[img]
Preview

Kriener, Jael and King, Andy (2012) Mutual Exclusion by Interpolation. In: Eleventh International Symposium on Functional and Logic Programming. (The full text of this publication is not available from this repository)

King, Andy and Mycroft, Alan and Simon, Axel and Reps, Tom (2012) Analysis of Executables: Benefits and Challenges. In: Analysis of Executables: Benefits and Challenges, January 29 to February 3, 2012, Wadern, Germany. (Full text available)
[img]
Preview

De Schreye, Danny and Janssens, Gerda (2012) PPDP '12 Proceedings of the 14th symposium on Principles and practice of declarative programming. In: 14th International Symposium on Association for Computing Machinery Principles and Practice of Declarative Programming, September 19-21, 2012, Leuven, Belgium. (The full text of this publication is not available from this repository)

Brauer, Jorg and King, Andy and Kriener, Jael (2011) Existential Quantification as Incremental SAT. In: Twenty Third International Conference on Computer Aided Verification. (The full text of this publication is not available from this repository)

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)
[img]
Preview

King, Andy (2008) Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry. In: Proceedings on Logic-Based Methods in Programming Envrionments. (The full text of this publication is not available from this repository)

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 0780394518. (Full text available)
[img]
Preview

Edited book

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 available from this repository)

Research report (external)

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)
[img]
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)
[img]
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: 10.1007/11799573_13. University of Kent, School of Computing, University of Kent, Canterbury, CT2 7NF ISBN 978-3-540-36635-5. (Full text available)
[img]
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)
[img]
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)
[img]
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)
[img]
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)
[img]
Preview

Howe, Jacob M. and King, Andy (2001) Widening BDDs. University of Kent, School of Computing, 9 pp. (Full text available)
[img]
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)
[img]
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)
[img]
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)
[img]
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)
[img]
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)
[img]
Preview

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

This list was generated on Wed Oct 22 05:43:22 2014 BST.