Danhyung Lee
Information and Communications University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Danhyung Lee.
Archive | 2013
Myungchul Kim; Byoungmoon Chin; Sungwon Kang; Danhyung Lee
This book presents the latest worldwide results in theory and practice of formal techniques for networked and distributed systems. The theme of the book is addressed by specialized papers in the following areas: Formal Methods in Software Development, Process Algebra, Timed Automata, Theories and Applications of Verification, Distributed Systems Testing, Test Sequence Derivation. In addition, the last part of the book contains special contributions by leading researchers in the above areas to add breadth and give more perspectives to the results. This volume contains the selected proceedings of the International Conference on Formal Techniques for Networked and Distributed Systems (Forte 2001), which was sponsored by the International Federation for Information Processing (Ifip) and held in Cheju Island, Korea in August 2001. Forte 2001 combines two prestigious conferences, Forte (Formal Description Techniques for Distributed Systems and Communication Protocols) and Pstv (Protocol Specification Testing and Verification), and has more than 20 years of history. Formal Techniques for Networked and Distributed Systems will be essential reading for researchers and engineers working in the fields of communications, test equipment R&D, and telecommunications, as well as to software engineering tool developers.KEYNOTE SPEECHES.- Ranking Abstraction as Companion to Predicate Abstraction.- Developing High Quality Software with Formal Methods: What Else Is Needed?.- A Testing Architecture for Designing High-Reliable MANET Protocols.- REGULAR PAPERS.- A Composition Operator for Systems with Active and Passive Actions.- A Formal Semantics of UML StateCharts by Means of Timed Petri Nets.- A Hierarchy of Implementable MSC Languages.- Combining Static Analysis and Model Checking for Systems Employing Commutative Functions.- Fast Generic Model-Checking for Data-Based Systems.- Logic and Model Checking for Hidden Markov Models.- Proving ??-Calculus Properties with SAT-Based Model Checking.- Ad Hoc Routing Protocol Verification Through Broadcast Abstraction.- Discovering Chatter and Incompleteness in the Datagram Congestion Control Protocol.- Thread Allocation Protocols for Distributed Real-Time and Embedded Systems.- A Petri Net View of Mobility.- Modular Verification of Petri Nets Properties: A Structure-Based Approach.- An Improved Conformance Testing Method.- Resolving Observability Problems in Distributed Test Architectures.- Automatic Generation of Conflict-Free IPsec Policies.- A Framework Based Approach for Formal Modeling and Analysis of Multi-level Attacks in Computer Networks.- Model Checking for Timed Statecharts.- Abstraction-Guided Model Checking Using Symbolic IDA* and Heuristic Synthesis.- Modeling and Verification of Safety-Critical Systems Using Safecharts.- Structure Preserving Data Abstractions for Statecharts.- Amortised Bisimulations.- Proof Methodologies for Behavioural Equivalence in Dpi.- Deriving Non-determinism from Conjunction and Disjunction.- Abstract Operational Semantics for Use Case Maps.- ArchiTRIO: A UML-Compatible Language for Architectural Description and Its Formal Semantics.- Submodule Construction for Extended State Machine Models.- Towards Synchronizing Linear Collaborative Objects with Operational Transformation.- Designing Efficient Fail-Safe Multitolerant Systems.- Hierarchical Decision Diagrams to Exploit Model Structure.- Computing Subgraph Probability of Random Geometric Graphs: Quantitative Analyses of Wireless Ad Hoc Networks.- Formalising Web Services.- From Automata Networks to HMSCs: A Reverse Model Engineering Perspective.- Properties as Processes: Their Specification and Verification.- SHORT PAPERS.- Epoch Distance of the Random Waypoint Model in Mobile Ad Hoc Networks.- Automatic Partitioner for Behavior Level Distributed Logic Simulation.- Expressive Completeness of an Event-Pattern Reactive Programming Language.- Formalizing Interoperability Testing: Quiescence Management and Test Generation.- Formal Description of Mobile IPv6 Protocol.- Incremental Modeling Under Large-Scale Distributed Interaction.- The Inductive Approach to Strand Space.- Compositional Modelling and Verification of IPv6 Mobility.
asia-pacific web conference | 2007
Jihyun Lee; Danhyung Lee; Sungwon Kang
This paper presents a Business Process Maturity Model (BPMM) for measuring and improving business process competence. The BPMM comprises maturity levels that are associated with the scope of influence of process areas, the capability of monitoring and controlling processes and the influence on process improvement It is based on the principle that any business process essentially consists of activities belonging to four categories; Input, Mechanism, Control, and Output. While constructing our BPMM, we aligned it with the terms, maturity levels, and some elements of Key Process Areas (KPAs) of CMM/CMMI, IS12207, and IS15288. We incorporated the results of the existing researches on Process Maturity Model (PMM) and Process Management Maturity Model (PMMM) and conducted a survey on a group of companies that are actively pursuing Business Process Management (BPM).
international conference on computational science and its applications | 2007
Tonny Kurniadi Satyananda; Danhyung Lee; Sungwon Kang; Sajid Ibrahim Hashmi
Feature models have been used to support requirements analysis and domain engineering in Software Product Line. By identifying the mapping between feature model and architecture model by capturing the relationships among elements in the models, we can establish the traceability between the two models. The identified traceability can be used to verify consistency between feature model and architecture model. On small scale models, the relationships among elements can be easily identified by manually analyzing the descriptions of models. But when the complexity of a model is high, a more formal approach will be useful to help identifying the traceability. In this paper, we develop an approach to identify traceability between feature model and component and connector view of software architecture using formal concept analysis (FCA) technique. This technique constructs a concept lattice structure. We propose several analysis criteria for concept lattice structure to identify traceability between the two models.
international conference on software engineering advances | 2007
Tonny Kurniadi Satyananda; Danhyung Lee; Sungwon Kang
During software development process, software artifacts are produced. Consistency among these artifacts should be verified to ensure error-free product. In software product line development, consistency becomes more important because commonalities and variabilities increase the complexity of relationship among artifacts. In this paper, we present a formal approach to verification of consistency between feature model and component and connector view of software architecture. By utilizing prototype verification system (PVS), we introduce our model of feature description and architecture description, and illustrate the consistency verification approach using a digital watch product line example.
Computer and Information Science | 2009
Jihyun Lee; Danhyung Lee; Sungwon Kang
A business process maturity model provides standards and measures to organizations in assessing, defining and improving business processes, thereby guiding them to achieving business goals and values. In this paper, we present a business process maturity model called Value based Process Maturity Model (vPMM) that overcomes the limitations of the existing models. The vPMM is a model that can be used to determine the maturity of an organization’s current business process practices by considering an organization’s business value creation capability as well. It helps an organization set priorities for improving its product production and/or service provisioning using a proven strategy and for developing the capability required to accomplish its business values.
International Journal of Software Engineering and Knowledge Engineering | 2010
Jihyun Lee; Sungwon Kang; Danhyung Lee
During the past decade a number of methods and techniques for software product line scoping have been developed. Although their basic goal is the same, when it comes to details it is often hard to see what they have in common, where they differ and what their strengths and weaknesses are. This makes it difficult for the user to decide when and how to use them because these methods and techniques sometimes describe the same concepts and activities with different terminologies and, more often than not, by that the activities and tasks defined in them do not exactly match with each other and their inputs/outcomes are not clearly defined. In this paper, we compare and analyze the mainstream approaches to software product line scoping, deduce their essential components and develop them into a unified approach that can be easily referred to and utilized by the user companies planning to launch product lines.
international conference on information networking | 2005
Hongseock Jeon; Myungchul Kim; Kyung-Hee Lee; Jeonghoon Mo; Danhyung Lee
Even though several RSVP extensions have been proposed to support QoS guarantee in mobile Internet, they still suffer from issues such as excessive advanced reservations or a nonoptimal path generated by Mobile IP. We propose an algorithm called “Link Layer Assisted Multicast based Mobile RSVP (LM-MRSVP)” to resolve the issues. Our implementation shows practicability of our proposal and the simulation study confirms our claims.
International Journal of Software Engineering and Knowledge Engineering | 2009
Sungwon Kang; Seonah Lee; Danhyung Lee
For software with nontrivial size and complexity, it is not feasible to manually perform architecture reconstruction. Therefore it is essential for the software architecture miner who is mining architecture from the existing software to have a well-defined software architecture reconstruction process that helps incorporate as much tool use as possible at the appropriate steps of architecture reconstruction. There are some existing software architecture reconstruction frameworks but they do not provide guidelines on how to systematically utilize tools to produce architecture views for a reconstruction purpose. In this paper, we propose a framework for tool-based software architecture reconstruction. This framework consists of a generic process for software architecture reconstruction and the steps to derive from it a concrete tool-based process to be used for actual architecture reconstruction. The architecture miner can use this framework to analyze source code for modifying source code as well as to reconstruct software architecture from source code.
The Kips Transactions:partd | 2009
Sungwon Kang; Danhyung Lee; Yu-Whoan Ahn
BPMN is a standard business process description notation developed by OMG. It allows the user to have an abstract view of a process that hides its details with the Collapsed Sub-Process notation. While it is a useful direction of abstraction that can be called the horizontal abstraction, a different kind of abstraction, the vertical abstraction, is necessary when different stakeholders of business would like to have different views of the business process form their own viewpoints of interest. For example, stakeholders may want to see a process from the viewpoint of a particular group of actors or from the viewpoint of a certain set of goals. This paper first extends horizontal abstraction capability of BPMN by introducing the notion of super edge and, moreover, adds the vertical abstraction capability to it by introducing the notions of `aspect attribute` and `interest specification` and notations for them.
computer and information technology | 2007
Tonny Kurniadi Satyananda; Danhyung Lee; Sungwon Kang
In software product line development, consistency among artifacts is important because commonalities and variabilities increase the complexity of relations among artifacts. For small scale models, the relations among elements can be easily identified and tracked by manually analyzing the descriptions of models. But when the complexity of models is high, a more systematic approach is required for identifying traceability information and verifying consistency between models. In this paper, by utilizing Formal Concept Analysis (FCA) and Prototype Verification System (PVS), we present a formal approach for identifying traceability and verifying consistency between feature model and component and connector view of software architecture.