Browse by Person (creator, editor, contributor, etc.)
Number of items: 68. Article
|
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.
The full text of this publication is not available from this repository.
|
|
|
Kriener, Jael and King, Andy
(2011)
RedAlert: Determinacy Inference for Prolog.
Theory and Practice of Logic Programming, 11
(4-5).
pp. 182-196.
The full text of this publication is not available from this repository.
|
|
|
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.
The full text of this publication is not available from this repository.
|
|
Book section
|
King, Andy and Lu, L. and Genaim, S.
(2006)
Detecting Determinacy in Prolog Programs.
In: Etalle, Sandro and Truszczynski, Mirek, eds.
Logic Programming.
Lecture Notes in Computer Science, 4079
.
Springer-Verlag, Berlin, pp. 132-147.
ISBN 978-3-540-36635-5.
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)  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 Berlin / Heidelberg, pp. 148-162.
ISBN 978-3-540-36635-5.
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)  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 Berlin / Heidelberg, pp. 177-191.
ISBN 978-3-540-33438-5.
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)  Preview |
|
|
Lu, Lunjin and King, Andy
(2005)
Determinacy inference for logic programs.
In: Sagiv, Mooly, ed.
Programming Languages and Systems.
Springer-Verlag, Berlin, pp. 108-123.
ISBN 9783540254355.
The full text of this publication is not available from this repository.
|
|
Monograph
|
Biallas, Sebastian and Brauer, J''org and King, Andy and Kowalewski, Stefan
(2012)
Proof Appendix for Loop Leaping with Closures.
Technical report.
, School of Computing
The full text of this publication is not available from this repository.
|
|
|
Martin, Jonathan.C. and King, Andy
(2003)
On Modular Termination Proofs.
Technical report.
University of Kent
The full text of this publication is not available from this repository.
|
|
|
Howe, J.M. and King, Andy
(2001)
Widening BDDs.
Technical report.
Great Britain:University of Kent
|
|
Conference or workshop item
|
Biallas, Sebastian and Brauer, J''org and King, Andy and Kowalewski, Stefan
(2012)
Loop Leaping with Closures.
In: Nineteenth Static Analysis Symposium.
The full text of this publication is not available from this repository.
|
|
|
Biallas, Sebastian and Brauer, J''org and King, Andy and Kowalewski, Stefan
(2012)
Loop Leaping with Closures.
In: UNSPECIFIED.
The full text of this publication is not available from this repository.
|
|
|
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.
|
|
|
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.
|
|
|
Howe, Jacob M. and King, Andy
(2010)
A Pearl on SAT Solving in Prolog.
In: Tenth International Symposium on Functional and Logic Programming.
The full text of this publication is not available from this repository.
|
|
|
King, Andy and Sondergaard, Harald
(2010)
Automatic Abstraction for Congruences.
In: Eleventh International Conference on Verification, Model Checking, and Abstract Interpretation.
The full text of this publication is not available from this repository.
|
|
|
Howe, J.M. and King, Andy
(2009)
Logahedra: a New Weakly Relational Domain.
In: International Symposium on Automated Technology for Verification and Analysis, OCT 13-16, 2009, Macao, Peoples Republic of China.
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)  Preview |
|
|
Charles, Philip and Howe, Jacob and King, Andy
(2009)
Integer Polyhedra for Program Analysis.
In: Proceedings of the Fifth International Conference on Algorithmic Aspects in Information and Management, Jun 15-17, 2009, San Francisco, CA.
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)  Preview |
|
|
Simon, Axel and King, Andy
(2007)
Taming the Wrapping of Integer Arithmetic.
In: File, Gilberto and Nielson, Hanne Riis, eds.
Fourteenth International Static Analysis Symposium.
Lecture Notes in Computer Science, 4634.
Springer
pp. 121-126.
ISBN 978-3-540-74060-5 .
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)  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-Verlag
pp. 315-330.
ISBN 3-540-20642-6 .
The full text of this publication is not available from this repository.
|
|
|
Benoy, Florence and King, Andy
(1997)
Inferring Argument Size Relationships with CLP(R).
In:
Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation.
Lecture Notes in Computer Science, 1207.
Springer-Verlag
pp. 204-223.
ISBN 3-540-62718-9 .
|
|
|
Martin, J.C. and King, Andy and Soper, P.
(1997)
Typed norms for typed logic programs.
In: Gallagher, J., ed.
Lecture Notes In Computer Science.
Springer-Verlag Berlin
pp. 224-238.
ISBN 3-540-62718-9.
The full text of this publication is not available from this repository.
|
|
Book
This list was generated on Sun May 19 01:53:33 2013 BST.
|