The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andy King: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andy King, Paul Soper
    Serialisation Analysis of Concurrent Logic Programs. [Citation Graph (0, 0)][DBLP]
    ALP, 1992, pp:322-334 [Conf]
  2. Axel Simon, Andy King
    Analyzing String Buffers in C. [Citation Graph (0, 0)][DBLP]
    AMAST, 2002, pp:365-379 [Conf]
  3. Axel Simon, Andy King
    Widening Polyhedra with Landmarks. [Citation Graph (0, 0)][DBLP]
    APLAS, 2006, pp:166-182 [Conf]
  4. Neil Kettle, Andy King
    An anytime symmetry detection algorithm for ROBDDs. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 2006, pp:243-248 [Conf]
  5. Andy King, Paul Soper
    Compile-Time Analysis of Concurrent Logic Programs for Multi-processors. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Parallelization in Inference Systems, 1990, pp:367- [Conf]
  6. Jacob M. Howe, Andy King
    Specialising Finite Domain Programs Using Polyhedra. [Citation Graph (0, 0)][DBLP]
    ECOOP Workshops, 1999, pp:258-259 [Conf]
  7. Samir Genaim, Andy King
    Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. [Citation Graph (0, 0)][DBLP]
    ESOP, 2003, pp:84-98 [Conf]
  8. Lunjin Lu, Andy King
    Determinacy Inference for Logic Programs. [Citation Graph (0, 0)][DBLP]
    ESOP, 2005, pp:108-123 [Conf]
  9. Andy King
    A Synergistic Analysis for Sharing and Groundness with Traces Linearity. [Citation Graph (0, 0)][DBLP]
    ESOP, 1994, pp:363-378 [Conf]
  10. Andy King, Jan-Georg Smaus, Patricia M. Hill
    Quotienting Share for Dependency Analysis. [Citation Graph (0, 0)][DBLP]
    ESOP, 1999, pp:59-73 [Conf]
  11. Andrew Heaton, Patricia M. Hill, Andy King
    Abstract Domains for Universal and Existential Properties. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:150-164 [Conf]
  12. Jacob M. Howe, Andy King
    Implementing Groundness Analysis with Definite Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:200-214 [Conf]
  13. Xuan Li, Andy King, Lunjin Lu
    Lazy Set-Sharing Analysis. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2006, pp:177-191 [Conf]
  14. Lunjin Lu, Andy King
    Backward Pair Sharing Analysis. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2004, pp:132-146 [Conf]
  15. Jacob M. Howe, Andy King
    Positive Boolean Functions as Multiheaded Clauses. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:120-134 [Conf]
  16. Andy King
    A Framework for Sharing Analysis. [Citation Graph (0, 0)][DBLP]
    ICLP-Workshops on Implementation of Logic Programming Systems, 1993, pp:137-149 [Conf]
  17. Andy King, Lunjin Lu
    Forward versus Backward Verification of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:315-330 [Conf]
  18. Andy King, Lunjin Lu, Samir Genaim
    Detecting Determinacy in Prolog Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2006, pp:132-147 [Conf]
  19. Andy King, Paul Soper
    Schedule Analysis of Concurrent Logic programs. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1992, pp:478-492 [Conf]
  20. Andy King, Paul Soper
    Depth-k Sharing and Freeness. [Citation Graph (0, 0)][DBLP]
    ICLP, 1994, pp:553-568 [Conf]
  21. Xuan Li, Andy King, Lunjin Lu
    Collapsing Closures. [Citation Graph (0, 0)][DBLP]
    ICLP, 2006, pp:148-162 [Conf]
  22. Kish Shen, Vítor Santos Costa, Andy King
    Distance: A New Metric for Controlling Granularity for Parallel Execution. [Citation Graph (0, 0)][DBLP]
    IJCSLP, 1998, pp:85-99 [Conf]
  23. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Domain Construction for Mode Analysis of Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1997, pp:418- [Conf]
  24. Andy King, Paul Soper
    Ordering Optimizations for Concurrent Logic Programs. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:221-228 [Conf]
  25. Florence Benoy, Andy King
    Inferring Argument Size Relationships with CLP(R). [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1996, pp:204-223 [Conf]
  26. Andrew Heaton, Patricia M. Hill, Andy King
    Analysis of Logic Programs with Delay. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1997, pp:148-167 [Conf]
  27. Jacob M. Howe, Andy King
    Specialising Fininte Domain Programs Using Polyhedra. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1999, pp:118-135 [Conf]
  28. Jacob M. Howe, Andy King, Lunjin Lu
    Analysing Logic Programs by Reasoning Backwards. [Citation Graph (0, 0)][DBLP]
    Program Development in Computational Logic, 2004, pp:152-188 [Conf]
  29. Jonathan C. Martin, Andy King
    On the Inference of Natural Level Mappings. [Citation Graph (0, 0)][DBLP]
    Program Development in Computational Logic, 2004, pp:432-452 [Conf]
  30. Jonathan C. Martin, Andy King, Paul Soper
    Typed Norms for Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1996, pp:224-238 [Conf]
  31. Axel Simon, Andy King, Jacob M. Howe
    Two Variables per Linear Inequality as an Abstract Domain. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2002, pp:71-89 [Conf]
  32. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1998, pp:289-307 [Conf]
  33. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Mode Analysis Domains for Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1999, pp:82-101 [Conf]
  34. Andy King, Paul Soper
    Reducing Scheduling Overheads for Concurrent Logic Programs. [Citation Graph (0, 0)][DBLP]
    PDK, 1991, pp:279-286 [Conf]
  35. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Termination of Logic Programs with block Declarations Running in Several Modes. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:73-88 [Conf]
  36. Lunjin Lu, Andy King
    Backward Type Inference Generalises Type Checking. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:85-101 [Conf]
  37. Axel Simon, Andy King
    Exploiting Sparsity in Polyhedral Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:336-351 [Conf]
  38. Andy King, Kish Shen, Florence Benoy
    Lower-bound Time-complexity Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ILPS, 1997, pp:261-275 [Conf]
  39. Neil Kettle, Andy King, Tadeusz Strzemecki
    Widening ROBDDs with Prime Implicants. [Citation Graph (0, 0)][DBLP]
    TACAS, 2006, pp:105-119 [Conf]
  40. Jonathan C. Martin, Andy King
    Generating Efficient, Terminating Logic Programs. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:273-284 [Conf]
  41. Axel Simon, Andy King
    Convex Hull of Planar H-Polyhedra [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  42. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Verifying Termination and Error-Freedom of Logic Programs with block Declarations [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  43. Andy King, Lunjin Lu
    A Backward Analysis for Constraint Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  44. Jacob M. Howe, Andy King
    Efficient Groundness Analysis in Prolog [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  45. Jacob M. Howe, Andy King
    Three Optimisations for Sharing [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  46. Florence Benoy, Andy King, Frédéric Mesnard
    Computing Convex Hulls with a Linear Solver [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  47. Andy King, Jonathan C. Martin
    Control Generation by Program Transformation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:69, n:1-2, pp:179-218 [Journal]
  48. Axel Simon, Andy King
    Convex hull of planar h-polyhedra. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2004, v:81, n:3, pp:259-271 [Journal]
  49. Jacob M. Howe, Andy King
    Abstracting numeric constraints with Boolean functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:1-2, pp:17-23 [Journal]
  50. Kish Shen, Vítor Santos Costa, Andy King
    Distance: A New Metric for Controlling Granularity for Parallel Execution. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 1999, v:1999, n:Special Issue 1, pp:- [Journal]
  51. Andy Heaton, Muhamed Abo-Zaed, Michael Codish, Andy King
    A simple polynomial groundness analysis for logic programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:45, n:1-3, pp:143-156 [Journal]
  52. Andy King
    Pair-sharing over rational trees. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:46, n:1-2, pp:139-155 [Journal]
  53. Patricia M. Hill, Andy King
    Determinacy and determinacy analysis. [Citation Graph (0, 0)][DBLP]
    J. Prog. Lang., 1997, v:5, n:1, pp:135-171 [Journal]
  54. Olivier Danvy, Andrzej Filinski, Jean-Louis Giavitto, Andy King, Pierre-Etienne Moreau, Carolyn L. Talcott
    Editorial. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2006, v:19, n:4, pp:343-344 [Journal]
  55. Andy King, Lunjin Lu
    A Backward Analysis for Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:4-5, pp:517-547 [Journal]
  56. Florence Benoy, Andy King, Frédéric Mesnard
    Computing convex hulls with a linear solver. [Citation Graph (0, 0)][DBLP]
    TPLP, 2005, v:5, n:1-2, pp:259-271 [Journal]
  57. Jan-Georg Smaus, Patricia M. Hill, Andy King
    Verifying Termination and Error-Freedom of Logic Programs with block Declarations. [Citation Graph (0, 0)][DBLP]
    TPLP, 2001, v:1, n:4, pp:447-486 [Journal]
  58. Jacob M. Howe, Andy King
    Efficient Groundness Analysis in Prolog. [Citation Graph (0, 0)][DBLP]
    TPLP, 2003, v:3, n:1, pp:95-124 [Journal]
  59. Jacob M. Howe, Andy King
    Three Optimisations for Sharing. [Citation Graph (0, 0)][DBLP]
    TPLP, 2003, v:3, n:2, pp:243-257 [Journal]
  60. Axel Simon, Andy King
    Taming the Wrapping of Integer Arithmetic. [Citation Graph (0, 0)][DBLP]
    SAS, 2007, pp:121-136 [Conf]

  61. Integer Polyhedra for Program Analysis. [Citation Graph (, )][DBLP]


  62. Logahedra: A New Weakly Relational Domain. [Citation Graph (, )][DBLP]


  63. Inferring Congruence Equations Using SAT. [Citation Graph (, )][DBLP]


  64. A Pearl on SAT Solving in Prolog. [Citation Graph (, )][DBLP]


  65. Untangling Reverse Engineering with Logic and Abstraction. [Citation Graph (, )][DBLP]


  66. Automatic Abstraction for Intervals Using Boolean Formulae. [Citation Graph (, )][DBLP]


  67. Automatic Abstraction for Congruences. [Citation Graph (, )][DBLP]


  68. Range Analysis of Microcontroller Code Using Bit-Level Congruences. [Citation Graph (, )][DBLP]


  69. Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry [Citation Graph (, )][DBLP]


Search in 0.024secs, Finished in 0.028secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002