Taint analysis of arrays in Android applications | 0 | 0.34 | 2021 |
Reflection on Building Hybrid Access Control by Configuring RBAC and MAC Features | 0 | 0.34 | 2020 |
Precise String Domain for Analyzing JavaScript Arrays and Objects | 0 | 0.34 | 2020 |
Code Smell Detection Tool for Java Script Programs | 0 | 0.34 | 2020 |
Analyzing JavaScript Programs Using Octagon Domain | 0 | 0.34 | 2019 |
Precise String Analysis for JavaScript Programs Using Automata | 0 | 0.34 | 2019 |
A three-phase decision making approach for self-adaptive systems using web services | 0 | 0.34 | 2018 |
Toward Interoperability of Smart Grids. | 2 | 0.37 | 2017 |
Design pattern-based model transformation supported by QVT. | 0 | 0.34 | 2017 |
B-kNN to Improve the Efficiency of kNN. | 0 | 0.34 | 2017 |
Opinions On Computing Education In Korean K-12 System: Higher Education Perspective | 1 | 0.35 | 2015 |
Improving Precision of Java Script Program Analysis with an Extended Domain of Intervals | 0 | 0.34 | 2015 |
Required behavior of sequence diagrams: Semantics and conformance | 5 | 0.41 | 2014 |
Building hybrid access control by configuring RBAC and MAC features. | 3 | 0.42 | 2014 |
Refinement Inference for Sequence Diagrams. | 0 | 0.34 | 2013 |
Towards Parametrizing Logic Program Analysis: Two Examples. | 0 | 0.34 | 2013 |
A feature-based approach for modeling role-based access control systems | 9 | 0.50 | 2011 |
A Polymorphic Type Dependency Analysis for Logic Programs. | 0 | 0.34 | 2011 |
A Feature-Based Modeling Approach to Configuring Privacy and Temporality in RBAC. | 0 | 0.34 | 2011 |
Required Behavior of Sequence Diagrams: Semantics and Refinement | 6 | 0.45 | 2011 |
A Feature-Based Modeling Approach for Building Hybrid Access Control Systems | 4 | 0.49 | 2011 |
Semantics-based Refinement of Mandatory Behavior of Sequence Diagrams | 0 | 0.34 | 2010 |
Simplifying Negative Goals Using Typed Existence Properties | 0 | 0.34 | 2010 |
Parametrizing Program Analysis by Lifting to Cardinal Power Domains | 0 | 0.34 | 2010 |
Incremental Computation of Success Patterns of Logic Programs | 0 | 0.34 | 2010 |
Verification of Structural Pattern Conformance Using Logic Programming | 4 | 0.47 | 2010 |
A verifiable modeling approach to configurable role-based access control | 5 | 0.44 | 2010 |
Quality-driven architecture development using architectural tactics | 50 | 1.83 | 2009 |
Using CLP Simplifications to Improve Java Bytecode Termination Analysis | 4 | 0.41 | 2009 |
Checking Emptiness of Non-Deterministic Regular Types with Set Operators | 1 | 0.35 | 2008 |
Inferring precise polymorphic type dependencies in logic programs | 0 | 0.34 | 2008 |
Pattern-Based Transformation Rules for Developing Interaction Models of Access Control Systems | 2 | 0.39 | 2008 |
A Tactic-Based Approach to Embodying Non-functional Requirements into Software Architectures | 4 | 0.41 | 2008 |
Implementing type-based constructive negation | 0 | 0.34 | 2007 |
Improving precision of type analysis using non-discriminative union | 4 | 0.39 | 2006 |
Inference of Design Pattern Instances in UML models via Logic Programming | 9 | 0.54 | 2006 |
Detecting determinacy in prolog programs | 4 | 0.45 | 2006 |
Lazy Set-Sharing Analysis | 2 | 0.36 | 2006 |
Inverting abstract unification for set-sharing | 0 | 0.34 | 2005 |
Use of correctness assertions in declarative diagnosis | 2 | 0.38 | 2005 |
Determinacy inference for logic programs | 7 | 0.54 | 2005 |
Backward Pair Sharing Analysis | 1 | 0.35 | 2004 |
Analysing Logic Programs by Reasoning Backwards | 8 | 0.55 | 2004 |
Forward versus Backward Verification of Logic Programs | 9 | 0.48 | 2003 |
Path dependent analysis of logic programs | 2 | 0.37 | 2002 |
A backward analysis for constraint logic programs | 25 | 0.82 | 2002 |
Backward Type Inference Generalises Type Checking | 6 | 0.42 | 2002 |
Parameterizing a Groundness Analysis of Logic Programs | 2 | 0.37 | 2001 |
A precise type analysis of logic programs | 5 | 0.44 | 2000 |
A regular type analysis of logic programs | 0 | 0.34 | 1999 |