2008 |
39 | EE | Suntae Kim,
Dae-Kyoo Kim,
Lunjin Lu,
Sooyong Park:
A Tactic-Based Approach to Embodying Non-functional Requirements into Software Architectures.
EDOC 2008: 139-148 |
38 | EE | Dae-Kyoo Kim,
Lunjin Lu:
Pattern-Based Transformation Rules for Developing Interaction Models of Access Control Systems.
ICSR 2008: 306-317 |
37 | EE | Lunjin Lu:
Inferring precise polymorphic type dependencies in logic programs.
PPDP 2008: 143-151 |
36 | EE | Lunjin Lu:
Checking Emptiness of Non-Deterministic Regular Types with Set Operators.
Electr. Notes Theor. Comput. Sci. 212: 191-206 (2008) |
35 | EE | Lunjin Lu:
Improving precision of type analysis using non-discriminative union.
TPLP 8(1): 33-79 (2008) |
2007 |
34 | EE | Lunjin Lu:
Implementing type-based constructive negation.
SAC 2007: 1299-1306 |
2006 |
33 | EE | Xuan Li,
Andy King,
Lunjin Lu:
Lazy Set-Sharing Analysis.
FLOPS 2006: 177-191 |
32 | EE | Dae-Kyoo Kim,
Lunjin Lu:
Inference of Design Pattern Instances in UML models via Logic Programming.
ICECCS 2006: 47-56 |
31 | EE | Andy King,
Lunjin Lu,
Samir Genaim:
Detecting Determinacy in Prolog Programs.
ICLP 2006: 132-147 |
30 | EE | Xuan Li,
Andy King,
Lunjin Lu:
Collapsing Closures.
ICLP 2006: 148-162 |
29 | EE | Lunjin Lu:
Improving Precision of Type Analysis Using Non-Discriminative Union
CoRR abs/cs/0612063: (2006) |
2005 |
28 | EE | Lunjin Lu,
Andy King:
Determinacy Inference for Logic Programs.
ESOP 2005: 108-123 |
27 | EE | Xuan Li,
Lunjin Lu:
Inverting abstract unification for set-sharing.
PPDP 2005: 129-138 |
26 | EE | Lunjin Lu:
Use of correctness assertions in declarative diagnosis.
SAC 2005: 1404-1408 |
2004 |
25 | EE | Lunjin Lu,
Andy King:
Backward Pair Sharing Analysis.
FLOPS 2004: 132-146 |
24 | EE | Jacob M. Howe,
Andy King,
Lunjin Lu:
Analysing Logic Programs by Reasoning Backwards.
Program Development in Computational Logic 2004: 152-188 |
2003 |
23 | EE | Andy King,
Lunjin Lu:
Forward versus Backward Verification of Logic Programs.
ICLP 2003: 315-330 |
22 | EE | Lunjin Lu:
Path Dependent Analysis of Logic Programs.
Higher-Order and Symbolic Computation 16(4): 341-377 (2003) |
2002 |
21 | EE | Lunjin Lu:
Path dependent analysis of logic programs.
PEPM 2002: 63-74 |
20 | EE | Lunjin Lu,
Andy King:
Backward Type Inference Generalises Type Checking.
SAS 2002: 85-101 |
19 | EE | Andy King,
Lunjin Lu:
A Backward Analysis for Constraint Logic Programs
CoRR cs.PL/0201011: (2002) |
18 | | Andy King,
Lunjin Lu:
A Backward Analysis for Constraint Logic Programs.
TPLP 2(4-5): 517-547 (2002) |
2001 |
17 | EE | Lunjin Lu:
Parameterizing a Groundness Analysis of Logic Programs.
SAS 2001: 146-164 |
16 | | Lunjin Lu:
On Dart-Zobel Algorithm for Testing Regular Type Inclusion.
SIGPLAN Notices 36(9): 81-85 (2001) |
2000 |
15 | EE | Lunjin Lu:
A precise type analysis of logic programs.
PPDP 2000: 214-225 |
1999 |
14 | | Lunjin Lu,
John G. Cleary:
A Regular Type Analysis of Logic Programs.
ICLP 1999: 613 |
13 | | Lunjin Lu,
John G. Cleary:
An Operational Semantics of Starlog.
PPDP 1999: 294-310 |
1998 |
12 | EE | John G. Cleary,
Lunjin Lu:
Constructive Negation Using Typed Existence Properties.
PLILP/ALP 1998: 411-426 |
11 | EE | Lunjin Lu,
John G. Cleary:
On Dart-Zobel Algorithm for Testing Regular Type Inclusion
CoRR cs.LO/9810001: (1998) |
10 | EE | Lunjin Lu,
John G. Cleary:
An Emptiness Algorithm for Regular Types with Set Operators
CoRR cs.LO/9811015: (1998) |
9 | EE | Lunjin Lu:
A Polymorphic Groundness Analysis of Logic Programs
CoRR cs.PL/9811001: (1998) |
8 | EE | Lunjin Lu:
Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs
CoRR cs.PL/9811012: (1998) |
7 | | Lunjin Lu:
Polymorphic Type Analysis in Logic Programs by Abstract Intepretation.
J. Log. Program. 36(1): 1-54 (1998) |
1996 |
6 | | Lunjin Lu:
A Mode Analysis of Logic Programs by Abstract Interpretation.
Ershov Memorial Conference 1996: 362-373 |
1995 |
5 | | Lunjin Lu:
Type Analysis of Logic Programs in the Presence of Type Definitions.
PEPM 1995: 241-252 |
1994 |
4 | | Lunjin Lu:
A Generic Declarative Diagnoser for Normal Logic Programs.
LPAR 1994: 290-304 |
1993 |
3 | | Lunjin Lu,
Peter Greenfield:
Logic Program Testing Based on Abstract Interpretation.
Formal Methods in Programming and Their Applications 1993: 170-180 |
1992 |
2 | | Lunjin Lu,
Peter Greenfield:
An Algorithm for Finite Approximations of Definite Programs and its Implementation in Prolog.
ALPUK 1992: 62-76 |
1 | EE | Lunjin Lu,
Peter Greenfield:
Abstract fixpoint semantics and abstract procedural semantics of definite logic programs.
ICCL 1992: 147-154 |