Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Lunjin Lu
2010 – today
- 2013
[c32]- 2011
[j12]Sangsig Kim, Dae-Kyoo Kim, Lunjin Lu, Suntae Kim, Sooyong Park: A feature-based approach for modeling role-based access control systems. Journal of Systems and Software 84(12): 2035-2052 (2011)
[j11]Lunjin Lu: A Polymorphic Type Dependency Analysis for Logic Programs. New Generation Comput. 29(4): 409-444 (2011)
[c31]Lunjin Lu, Dae-Kyoo Kim: Required Behavior of Sequence Diagrams: Semantics and Refinement. ICECCS 2011: 127-136
[c30]Sangsig Kim, Yen-Ting Lee, Yuanlin Zhu, Dae-Kyoo Kim, Lunjin Lu, Vijayan Sugumaran: A Feature-Based Modeling Approach to Configuring Privacy and Temporality in RBAC. SEKE 2011: 666-671
[c29]Sangsig Kim, Dae-Kyoo Kim, Lunjin Lu, Sooyong Park, Suntae Kim: A Feature-Based Modeling Approach for Building Hybrid Access Control Systems. SSIRI 2011: 88-97- 2010
[j10]
[j9]Lunjin Lu, Dae-Kyoo Kim, Yuanlin Zhu, Sangsig Kim: Verification of Structural Pattern Conformance Using Logic Programming. J. UCS 16(17): 2455-2474 (2010)
[c28]Dae-Kyoo Kim, Lunjin Lu, Sangsig Kim: A Verifiable Modeling Approach to Configurable Role-Based Access Control. FASE 2010: 188-202
[i9]Lunjin Lu, Dae-Kyoo Kim: Semantics-based Refinement of Mandatory Behavior of Sequence Diagrams. CoRR abs/1003.1160 (2010)
[i8]Lunjin Lu: Parametrizing Program Analysis by Lifting to Cardinal Power Domains. CoRR abs/1005.4616 (2010)
[i7]Lunjin Lu, John G. Cleary: Simplifying Negative Goals Using Typed Existence Properties. CoRR abs/1009.2178 (2010)
2000 – 2009
- 2009
[j8]Fausto Spoto, Lunjin Lu, Fred Mesnard: Using CLP Simplifications to Improve Java Bytecode Termination Analysis. Electr. Notes Theor. Comput. Sci. 253(5): 129-144 (2009)
[j7]Suntae Kim, Dae-Kyoo Kim, Lunjin Lu, Sooyong Park: Quality-driven architecture development using architectural tactics. Journal of Systems and Software 82(8): 1211-1231 (2009)- 2008
[j6]Lunjin Lu: Checking Emptiness of Non-Deterministic Regular Types with Set Operators. Electr. Notes Theor. Comput. Sci. 212: 191-206 (2008)
[j5]Lunjin Lu: Improving precision of type analysis using non-discriminative union. TPLP 8(1): 33-79 (2008)
[c27]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
[c26]Dae-Kyoo Kim, Lunjin Lu: Pattern-Based Transformation Rules for Developing Interaction Models of Access Control Systems. ICSR 2008: 306-317
[c25]- 2007
[c24]- 2006
[c23]
[c22]Dae-Kyoo Kim, Lunjin Lu: Inference of Design Pattern Instances in UML models via Logic Programming. ICECCS 2006: 47-56
[c21]
[c20]
[i6]Lunjin Lu: Improving Precision of Type Analysis Using Non-Discriminative Union. CoRR abs/cs/0612063 (2006)- 2005
[c19]
[c18]
[c17]- 2004
[c16]
[c15]Jacob M. Howe, Andy King, Lunjin Lu: Analysing Logic Programs by Reasoning Backwards. Program Development in Computational Logic 2004: 152-188- 2003
[j4]Lunjin Lu: Path Dependent Analysis of Logic Programs. Higher-Order and Symbolic Computation 16(4): 341-377 (2003)
[c14]- 2002
[j3]
[c13]
[c12]
[i5]- 2001
[j2]Lunjin Lu: On Dart-Zobel Algorithm for Testing Regular Type Inclusion. SIGPLAN Notices 36(9): 81-85 (2001)
[c11]- 2000
[c10]
1990 – 1999
- 1999
[c9]
[c8]- 1998
[j1]Lunjin Lu: Polymorphic Type Analysis in Logic Programs by Abstract Intepretation. J. Log. Program. 36(1): 1-54 (1998)
[c7]John G. Cleary, Lunjin Lu: Constructive Negation Using Typed Existence Properties. PLILP/ALP 1998: 411-426
[i4]Lunjin Lu, John G. Cleary: On Dart-Zobel Algorithm for Testing Regular Type Inclusion. CoRR cs.LO/9810001 (1998)
[i3]Lunjin Lu, John G. Cleary: An Emptiness Algorithm for Regular Types with Set Operators. CoRR cs.LO/9811015 (1998)
[i2]
[i1]Lunjin Lu: Deriving Abstract Semantics for Forward Analysis of Normal Logic Programs. CoRR cs.PL/9811012 (1998)- 1996
[c6]Lunjin Lu: A Mode Analysis of Logic Programs by Abstract Interpretation. Ershov Memorial Conference 1996: 362-373- 1995
[c5]- 1994
[c4]- 1993
[c3]Lunjin Lu, Peter Greenfield: Logic Program Testing Based on Abstract Interpretation. Formal Methods in Programming and Their Applications 1993: 170-180- 1992
[c2]Lunjin Lu, Peter Greenfield: An Algorithm for Finite Approximations of Definite Programs and its Implementation in Prolog. ALPUK 1992: 62-76
[c1]Lunjin Lu, Peter Greenfield: Abstract fixpoint semantics and abstract procedural semantics of definite logic programs. ICCL 1992: 147-154
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-01 22:17 CEST by the dblp team



