• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.49-57
• /
• 2006

While developing a complex reactive software system. it is very important to analyze the user requirement and reflect it to the developed system. Therefore understanding the need of users precisely and promptly is the key to the successful software system development. Among several requirement specification languages, message sequence charts (MSCs), also known as sequence diagrams in UML are the most widely used scenario notation. Live Sequence Charts (LSCs) are a variant ot MSCs, characterized by its message abstraction facility and the modality of scenarios. In this paper, I define the formal semantics of LSC specification including the essential language constructs such as pre-charts, variables, assignment and conditions. The range of the formalized LSC language has been broadened, and the scope of the formalized semantics is much closer to the complete LSC specification.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.187-195
• /
• 2000

Embedded software generates its outputs using current states of the system as well as external inputs. When a module in embedded software is tested, we need an automated testing tool, which generates possible sequences to reach the module as well as input data of the module, to reduce the testing time and to improve the quality of software. In this paper, we use decision table to specify the functionality of the module and data-annotated MSC (Message Sequence Charts) to describe scenarios, and implement a tool, which we call MSCTest, to automate the testing process. MSCTest consists of MSC graphic editor, test sequence and data generator, and test driver generator. MSCTest is effectively applied to test EsWin which is a kind of window library used in embedded systems.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.634-648
• /
• 2001

Message Sequence Charts(MSC) has been used to describe the interactions of numerous concurrent tasks in telecommunication software. After the MSC specification is verified in requirement analysis phase, it can be used not only to synthesize state-based design models, but also to generate test sequences. Until now, the verification is accomplished by generating global state transition graph using the location information only. In this paper, we extend the condition statement of MSC to describe the activation condition of scenarios and the change of state variables, and propose an approach to construct global finite state machine (GFSM) using this information. The GFSM only includes feasible states and transitions of the system. We can generate the test sequences using the existing FSM-based test sequence generation technology.

• Journal of KIISE:Software and Applications
• /
• v.27 no.2
• /
• pp.108-119
• /
• 2000

Most of prior works on testing parallel programs have concentrated on how to guarantee the reproducibility by employing event traces exercised during executions of a program. Consequently, little work has been done to generate meaningful event sequences, especially, from specifications. This paper describes techniques for deriving event sequences from Message Sequence Charts(MSCs) which are widely used in telecommunication areas for its simplicity in specifying the behaviors of a program. For deriving event sequences from MSCs, we have to uncover the causality relations among events embedded implicitly in MSCs. In order to attain this goal, we adapt vector time stamping which has been previously used to determine the ordering of events taken place during an execution of interacting processes. Then, valid event sequences, satisfying the causality relations, are generated according to the interleaving rules suggested in this paper. The feasibility of our testing technique was investigated using the phone conversation example. In addition, we discussed on the experimental results gained from the example and how to combine various test criteria into our testing environment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.451-453
• /
• 2000

메시지 순서도(Message Sequence Chart,MSC)는 ITU-T에서 국제적인 표준으로 제안되어 주로 전기 통신 교환 시스템과 같은 실시간 시스템을 위한 통신 행위에 대한 개괄적인 표현 방법으로서 널리 사용되어지고 있으며 요구 명세, 인터페이스 명세, 시뮬레이션 및 검정을 위해 사용되어지고 있다. MSC의 장점이라면 표현된 시스템의 행위를 직관적으로 이해할 수 있게 해주는 그래픽 표현을 제공하는 것이다. 의미론 입장에서 보면 MSC는 폴세스 대수 ACP의 변형인 PA$\varepsilon$에 의해 의미를 부여받고 있긴 하지만 이해하기가 난해한 것이 사실이다. 본 논문에서는 MSC의 동작적 의미를 분석하며 ACSR로 변환하여 그 의미를 보다 쉽게 파악하는 방법론에 대해 다룬다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.4
• /
• pp.439-446
• /
• 2003

In this paper, a single sign-on system has been designed and implemented. The purpose of the proposed system is that a user logs in once using a single password and gets authenticated access to all the servers that he is authorized to use without sending any passwords over the network. The proposed system involves the use of digital signature and cryptographic authentication protocols. For its implementation, a public-key infrastructure is also designed and implemented. To view the behavior of the proposed system, message sequence charts and state transition diagrams have been

• ETRI Journal
• /
• v.18 no.4
• /
• pp.265-286
• /
• 1997

This paper presents a new software development environment that supports an integrated methodology for covering all phases of software development and gives integrated methods with tools for ITUT (Telecommunication Standardization Section of the International Telecommunication Union) languages. The design of the environment to improve software productivity and quality is based on five main concepts: 1) formal specifications based on SDL (Specification and Description Language) and MSC (Message Sequence Charts) in the design phase, 2) verification and validation of those designs by tools, 3) automatic code generation and a safe separate compilation scheme based on CHILL (CCITT High-Level Language) to facilitate programming-in-the-many and programming-in-the-large. 4) debugging of distributed real-time concurrent CHILL programs, and 5) simulation of application software for integrated testing on the host machine based on CHILL. The application results of the environment compared with other approaches show that the productivity is increased by 19 % because of decreasing implementation and testing cost, and the quality is increased by 83 % because of the formal specifications with its static and dynamic checking facilities.

• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.370-383
• /
• 2000

This paper describes a new technique known as specification-based regression testing that is used for the revalidation of concurrent programs after changes are made to specifications. This type of regression testing requires sequencing constraint that specify precedence relations on the synchronization events. In order to extract sequencing constraint automatically, we use Message Sequence Charts(MSCs) that are considered partial and nondeterministic specifications. We show how to identify which sequencing constraint is affected by the modifications made to a specification rather than creating new sequencing constraint from scratch to reduce the cost of regression testing. We also describe how to determine that each affected sequencing constraint is satisfied by a program being tested.

• Journal of KIISE:Software and Applications
• /
• v.30 no.11
• /
• pp.1015-1024
• /
• 2003

In [1] we proposed a method to generate a test model (GFSM) from a set of scenarios of embedded software. Each scenario describes the interaction sequences for an external input event. Although these external events are generated and accepted alternatively and concurrently by embedded software, we considered only the alternative relations. In this paper, we describe an improved algorithm to generate GFSM from concurrent scenarios, and propose methods to reduce the number of transitions in the GFSM. The first is the synchronous interpretation of message passing instead of asynchronous one considering the real behavior of tasks in embedded software. The others apply the partial order techniques to the GFSM using independent regions. We apply the method to generate a reduced GFSM of embedded software running on a digital TV.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.107-121
• /
• 2014

Distributed systems are collection of physically distributed computers linked by a network. General use of wired/wireless Internet enables users to make use of distributed service anytime and anywhere. The explosive growth of distributed services strongly requires functional verification of services as well as verification of non-functional elements such as service quality. In order to verify distributed services it is necessary to build a test environment for distributed systems. Because, however, distributed systems are composed of physically distributed nodes, efforts to construct a test environment are required more than those in a test environment for a monolithic system. In this paper we propose a test framework to verify functional and non-functional features of distributed systems. The suggested framework automatically generates test cases through the message sequence charts, and includes a test driver composed of the virtual nodes which can simulate the physically distributed nodes. The test result can be checked easily through the various graphs and the graphical user interface (GUI). The test framework can reduce testing efforts for a distributed system and can enhance the reliability of the system.