earticle

논문검색

An Efficient Algorithm of Simplest LTS using Strong Equivalence for White Box Approach

초록

영어

In a large system, it is the most important work to consider the verification of the overall source codes and also to test minimal test cases for the maximal test coverage. In the current testing situations, if a complicated and huge system is developed, it may be difficult to test all the source codes. How could it extract small-sized test cases and satisfy high coverage if possible? For this, our previous research worked a simplest LTS using two steps of the transformation algorithm. Bur this paper suggests an efficient algorithm to transform original LTS into Simplest LTS at one time to extract minimal test cases for the maximal test coverage. It can expect an advantage to decrease computer sources and testing time epochally because it tests errors after excluding the recursion of software source codes with Strong Equivalence and optimizing them.

목차

Abstract
 1. Introduction
 2. Preliminaries
  2.1. Related Work
  2.2. Smallest Labeled Transition System
  2.3. Simplest Labeled Transition System
 3. Improved Simplest Algorithm Transformation
 4. Conclusion
 Acknowledgements
 References

저자정보

  • Byungho Park Dept. of CIC, Hongik University
  • Yong B. Park Dept. of Computer Science, Dankook University
  • Robert Youngchul Kim Dept. of CIC, Hongik University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.