Name
Affiliation
Papers
LUNJIN LU
Oakland University
63
Collaborators
Citations 
PageRank 
41
229
26.40
Referers 
Referees 
References 
309
889
1243
Search Limit
100889
Title
Citations
PageRank
Year
Taint analysis of arrays in Android applications00.342021
Reflection on Building Hybrid Access Control by Configuring RBAC and MAC Features00.342020
Precise String Domain for Analyzing JavaScript Arrays and Objects00.342020
Code Smell Detection Tool for Java Script Programs00.342020
Analyzing JavaScript Programs Using Octagon Domain00.342019
Precise String Analysis for JavaScript Programs Using Automata00.342019
A three-phase decision making approach for self-adaptive systems using web services00.342018
Toward Interoperability of Smart Grids.20.372017
Design pattern-based model transformation supported by QVT.00.342017
B-kNN to Improve the Efficiency of kNN.00.342017
Opinions On Computing Education In Korean K-12 System: Higher Education Perspective10.352015
Improving Precision of Java Script Program Analysis with an Extended Domain of Intervals00.342015
Required behavior of sequence diagrams: Semantics and conformance50.412014
Building hybrid access control by configuring RBAC and MAC features.30.422014
Refinement Inference for Sequence Diagrams.00.342013
Towards Parametrizing Logic Program Analysis: Two Examples.00.342013
A feature-based approach for modeling role-based access control systems90.502011
A Polymorphic Type Dependency Analysis for Logic Programs.00.342011
A Feature-Based Modeling Approach to Configuring Privacy and Temporality in RBAC.00.342011
Required Behavior of Sequence Diagrams: Semantics and Refinement60.452011
A Feature-Based Modeling Approach for Building Hybrid Access Control Systems40.492011
Semantics-based Refinement of Mandatory Behavior of Sequence Diagrams00.342010
Simplifying Negative Goals Using Typed Existence Properties00.342010
Parametrizing Program Analysis by Lifting to Cardinal Power Domains00.342010
Incremental Computation of Success Patterns of Logic Programs00.342010
Verification of Structural Pattern Conformance Using Logic Programming40.472010
A verifiable modeling approach to configurable role-based access control50.442010
Quality-driven architecture development using architectural tactics501.832009
Using CLP Simplifications to Improve Java Bytecode Termination Analysis40.412009
Checking Emptiness of Non-Deterministic Regular Types with Set Operators10.352008
Inferring precise polymorphic type dependencies in logic programs00.342008
Pattern-Based Transformation Rules for Developing Interaction Models of Access Control Systems20.392008
A Tactic-Based Approach to Embodying Non-functional Requirements into Software Architectures40.412008
Implementing type-based constructive negation00.342007
Improving precision of type analysis using non-discriminative union40.392006
Inference of Design Pattern Instances in UML models via Logic Programming90.542006
Detecting determinacy in prolog programs40.452006
Lazy Set-Sharing Analysis20.362006
Inverting abstract unification for set-sharing00.342005
Use of correctness assertions in declarative diagnosis20.382005
Determinacy inference for logic programs70.542005
Backward Pair Sharing Analysis10.352004
Analysing Logic Programs by Reasoning Backwards80.552004
Forward versus Backward Verification of Logic Programs90.482003
Path dependent analysis of logic programs20.372002
A backward analysis for constraint logic programs250.822002
Backward Type Inference Generalises Type Checking60.422002
Parameterizing a Groundness Analysis of Logic Programs20.372001
A precise type analysis of logic programs50.442000
A regular type analysis of logic programs00.341999
  • 1
  • 2