The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lunjin Lu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lunjin Lu, Peter Greenfield
    An Algorithm for Finite Approximations of Definite Programs and its Implementation in Prolog. [Citation Graph (0, 0)][DBLP]
    ALPUK, 1992, pp:62-76 [Conf]
  2. Lunjin Lu
    A Mode Analysis of Logic Programs by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 1996, pp:362-373 [Conf]
  3. Lunjin Lu, Peter Greenfield
    Logic Program Testing Based on Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    Formal Methods in Programming and Their Applications, 1993, pp:170-180 [Conf]
  4. Lunjin Lu, Andy King
    Determinacy Inference for Logic Programs. [Citation Graph (0, 0)][DBLP]
    ESOP, 2005, pp:108-123 [Conf]
  5. Xuan Li, Andy King, Lunjin Lu
    Lazy Set-Sharing Analysis. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2006, pp:177-191 [Conf]
  6. Lunjin Lu, Andy King
    Backward Pair Sharing Analysis. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2004, pp:132-146 [Conf]
  7. Lunjin Lu, Peter Greenfield
    Abstract fixpoint semantics and abstract procedural semantics of definite logic programs. [Citation Graph (0, 0)][DBLP]
    ICCL, 1992, pp:147-154 [Conf]
  8. Lunjin Lu, John G. Cleary
    A Regular Type Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1999, pp:613- [Conf]
  9. Andy King, Lunjin Lu
    Forward versus Backward Verification of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:315-330 [Conf]
  10. Andy King, Lunjin Lu, Samir Genaim
    Detecting Determinacy in Prolog Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2006, pp:132-147 [Conf]
  11. Xuan Li, Andy King, Lunjin Lu
    Collapsing Closures. [Citation Graph (0, 0)][DBLP]
    ICLP, 2006, pp:148-162 [Conf]
  12. 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]
  13. Lunjin Lu
    A Generic Declarative Diagnoser for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 1994, pp:290-304 [Conf]
  14. Lunjin Lu
    Path dependent analysis of logic programs. [Citation Graph (0, 0)][DBLP]
    PEPM, 2002, pp:63-74 [Conf]
  15. Lunjin Lu
    Type Analysis of Logic Programs in the Presence of Type Definitions. [Citation Graph (0, 0)][DBLP]
    PEPM, 1995, pp:241-252 [Conf]
  16. John G. Cleary, Lunjin Lu
    Constructive Negation Using Typed Existence Properties. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:411-426 [Conf]
  17. Xuan Li, Lunjin Lu
    Inverting abstract unification for set-sharing. [Citation Graph (0, 0)][DBLP]
    PPDP, 2005, pp:129-138 [Conf]
  18. Lunjin Lu
    A precise type analysis of logic programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:214-225 [Conf]
  19. Lunjin Lu, John G. Cleary
    An Operational Semantics of Starlog. [Citation Graph (0, 0)][DBLP]
    PPDP, 1999, pp:294-310 [Conf]
  20. Lunjin Lu
    Use of correctness assertions in declarative diagnosis. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:1404-1408 [Conf]
  21. Lunjin Lu
    Implementing type-based constructive negation. [Citation Graph (0, 0)][DBLP]
    SAC, 2007, pp:1299-1306 [Conf]
  22. Lunjin Lu
    Parameterizing a Groundness Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2001, pp:146-164 [Conf]
  23. Lunjin Lu, Andy King
    Backward Type Inference Generalises Type Checking. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:85-101 [Conf]
  24. Lunjin Lu, John G. Cleary
    On Dart-Zobel Algorithm for Testing Regular Type Inclusion [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  25. Lunjin Lu, John G. Cleary
    An Emptiness Algorithm for Regular Types with Set Operators [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  26. Andy King, Lunjin Lu
    A Backward Analysis for Constraint Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  27. Lunjin Lu
    A Polymorphic Groundness Analysis of Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  28. Lunjin Lu
    Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  29. Lunjin Lu
    Polymorphic Type Analysis in Logic Programs by Abstract Intepretation. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1998, v:36, n:1, pp:1-54 [Journal]
  30. Lunjin Lu
    Path Dependent Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2003, v:16, n:4, pp:341-377 [Journal]
  31. Lunjin Lu
    On Dart-Zobel Algorithm for Testing Regular Type Inclusion. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 2001, v:36, n:9, pp:81-85 [Journal]
  32. 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]
  33. Dae-Kyoo Kim, Lunjin Lu
    Inference of Design Pattern Instances in UML models via Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICECCS, 2006, pp:47-56 [Conf]
  34. Lunjin Lu
    Improving Precision of Type Analysis Using Non-Discriminative Union [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  35. A Tactic-Based Approach to Embodying Non-functional Requirements into Software Architectures. [Citation Graph (, )][DBLP]


  36. A Verifiable Modeling Approach to Configurable Role-Based Access Control. [Citation Graph (, )][DBLP]


  37. Pattern-Based Transformation Rules for Developing Interaction Models of Access Control Systems. [Citation Graph (, )][DBLP]


  38. Inferring precise polymorphic type dependencies in logic programs. [Citation Graph (, )][DBLP]


  39. Semantics-based Refinement of Mandatory Behavior of Sequence Diagrams [Citation Graph (, )][DBLP]


  40. Parametrizing Program Analysis by Lifting to Cardinal Power Domains [Citation Graph (, )][DBLP]


  41. Checking Emptiness of Non-Deterministic Regular Types with Set Operators. [Citation Graph (, )][DBLP]


  42. Using CLP Simplifications to Improve Java Bytecode Termination Analysis. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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