• Journal of KIISE:Software and Applications
• /
• v.37 no.12
• /
• pp.882-891
• /
• 2010

Many automated dynamic test data generation technique have been proposed. The techniques evaluate fitness of test data through executing instrumented Software Under Test (SUT) and then generate new test data based on evaluated fitness values and optimization algorithms. Previous researches and experiments have been showed that these techniques generate effective test data. However, optimization algorithms in these techniques incur much time to generate test data, which results in huge test case generation cost. In this paper, we propose a technique for reducing the time of evaluating a fitness of test data among steps of dynamic test data generation methods. We introduce the concept of Fitness Evaluation Program (FEP), derived from a path constraint of SUT. We suggest a test data generation method based on FEP and implement a test generation tool, named ConGA. We also apply ConGA to generate test cases for C programs, and evaluate efficiency of the FEP-based test case generation technique. The experiments show that the proposed technique reduces 20% of test data generation time on average.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.150-152
• /
• 2012

일반적으로 테스트 데이터 자동 생성을 지원하기 위해 심볼릭 실행기나 제약 해결기와 같은 도구를 요구한다. 그러나 이와 같은 도구들을 개발하는 것은 상당한 노력이 요구되는 것도 사실이다. 이 논문에서는 이러한 도구들의 지원 없이 분기 커버리지를 효과적으로 달성할 수 있는 테스트 데이터 생성 방법을 제안한다. 이를 위해 경로 지향 테스트 데이터 생성을 위해 개발된 Korel의 방법을 확장하여 프로그램의 분기들을 가능한 많이 실행할 수 있는 테스트 데이터를 효과적으로 생성하는 방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.460-462
• /
• 2001

테스트 데이터의 자동 생성은 소프트웨어 테스팅에서 가장 중요하면서도 어려운 부분이다. 대부분의 데스트 데이터 자동생성에 관한 연구는 명세로부터 테스트 데이터를 자동 생성하는 방식이며 이틀 위해 정확한 정형적 명세를 필요로 한다. 본 논문에서 는 프로그램을 실 행하지 않고 프로그램의 동적인 특성을 분석할 수 있는 요약 해석(abstract interpretation) 방법과 선후 지배 관계(pre-, postdominance relationship)를 이용하여 프로그램 코드로부터 직접 테스트 데이터를 자동 생성할 수 있는 방법 을 제안한다.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.451-460
• /
• 2013

In order to achieve high test coverage, it is usual to generate test data using various techniques including symbolic execution, data flow analysis or constraints solving. Recently, a technique for automated test data generation that fulfills high coverage effectively without those sophisticated means has been proposed. However, the technique shows its weakness in the generation of test data that leads to high coverage for programs having branch conditions where different memory locations are binded during execution. For certain programs with flag conditions, in particular, high coverage can not be achieved because specific branches are not executed. To address the problem, this paper presents dynamic branch coverage criteria and a test data generation technique based on the notion of dynamic branch. It is shown that the proposed technique compared to the previous approach is more effective by conducting experiments involving programs with flag conditions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.189-197
• /
• 2012

It is usual for test data generation to be performed using either high-level specifications or source codes written in high-level programming languages. In certain circumstances, however, such information is not always available. This paper presents a technique that generates test data based on executable object codes. The proposed technique makes use of a very simple function minimization technique without sophisticated object code analysis and produces test data dynamically. We have conducted a simple experiment to evaluate the effectiveness of the proposed test data generation technique with a triangle classification program to show that branch coverage can be easily achieved.

• Journal of Software Engineering Society
• /
• v.24 no.2
• /
• pp.35-45
• /
• 2011

Simulated annealing has been studied a long times. And it is one of the effective techniques for test data generation. But basic SA methods showed bad performance because of neighborhood selection strategies in the case of large input domain. To overcome this limitation, we propose new neighborhood selection approach, Branch Distance. We performs case studies based on the proposed approach to evaluate it's performance and to compare it whit basic SA and Random test generation. The results of the case studies appear that proposed approach show better performance than the other approach.

• Annual Conference of KIPS
• /
• 2001.04a
• /
• pp.197-200
• /
• 2001

이 논문은 웹기반 소프트웨어를 테스트하기 위한 오러클을 생성하는 방법을 제안하고 설명한다. 웹 페이지를 구성하는 응용 컴포넌트들의 구조를 파악하고 각 페이지를 구동시키는 액션들을 찾아내어 상태기반의 테스트 데이터를 찾아내는 방법이다. 테스트 스크립트를 작성하기 위하여 partial-W 방법을 도입하였으며 이를 이용하여 테스트 케이스의 값을 선택할 수 있다. 테스트 슈트는 언어 독립적이며 실행가능하다. 웹 응용의 특징인 동적인 인터렉션을 유한 상태기계(Finite State Machine)로 표현하고 각 상태를 변화시키는 웹 페이지의 사용자 입격을 결합하여 테스트 오러클을 생성한다.

• The Journal of the Korea Contents Association
• /
• v.12 no.11
• /
• pp.39-48
• /
• 2012

It is well known that software testing amounts for a significant portion of software development cost. In order to reduce the cost of software testing. a lot of researches on automated test data generation have been performed. Sophisticated tools for performing symbolic execution or solving a system of path constraints are required to support automated test data generation. Developing or purchasing those tools leads to another factor of increasing the cost involving software testing. In this paper, we propose a dynamic test data generation approach that does not depend on symbolic execution or constraint solving at all. The proposed approach extends Korel's path-oriented method to satisfy the branch coverage criterion effectively. We conducted an experiment to evaluate the effectiveness of the proposed technique with a triangle classification program to show that branch coverage can be easily achieved.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.471-478
• /
• 2013

This paper proposes a black-box based test case generation method for Simulink/Stateflow model utilizing the RRT algorithm which is a method to efficiently solve the path planning for complicated systems. The proposed method in the paper tries to solve the reachability problem with the RRT algorithm, which has to be solved for black-box based test case generations. A major problem of the RRT based test case generation algorithms is that the cost such as running time and required memory size is too much for complicated Stateflow model. The typical RRT algorithm expands rapidly-exploring random tree (RRT) in a single state space. But the proposed method expands it in dynamic state space based on the state of Simulink model, consequently reducing the cost. In the paper, a new definition of RRT state space, a distance measure and a test case generation algorithm are proposed. The performance of proposed method is verified through the experiment against Stateflow model.

• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.516-519
• /
• 2008

최근 엔터프라이즈 애플리케이션은 J2EE 컴포넌트로 개발된다. J2EE 플랫폼은 애플리케이션을 개발하는데 편리한 기능을 제공한다. 하지만 J2EE 애플리케이션의 테스트는 J2EE 서버 내부에서 자원을 관리하는 컨테이너의 접근 통제 때문에 기존의 테스트 방법으로 수행하기 어렵다. 본 논문에서는 J2EE 환경에 맞는 J2EE 애플리케이션의 테스트 방법을 제안한다. 이 방법은 애플리케이션을 구성하는 EJB 컴포넌트를 정적 및 동적 분석하여 획득한 정보로 애플리케이션의 메소드 커버리지를 분석하고, 메소드 커버리지를 향상시키기 위한 테스트 데이터를 생성하여 J2EE 애플리케이션을 테스트한다.