Earticle

초록

영어

Cause-effect graphs can be used for specifying safety critical systems including avionics control software that are often intended to satisfy Boolean expression. Using cause-effect graphs for requirements-based testing demands the ability of dealing with various constraints in cause-effect graphs. Due to its rapid advance, Boolean Satisfiability (SAT) solving seems to be a promising approach for constraint handling. In this paper, we present three approaches using SAT solving for pairwise test generation from cause-effect graphs. One is an ideal approach that tries to obtain a minimal set of tests. Another approach focuses on breaking the problem to smaller solvable problems to scale the applicability of SAT solving. The other makes full use of a partial instance that forms a part of a solution known priori. We compare the three approaches in terms of the number of generated pairwise tests and fault detection capability. Comparison results show that an approach using partial instances can generate less number of pairwise tests than the other two approaches without degrading fault detection capability.

목차

Abstract
 1. Introduction
 2. Cause-Effect Graphs
 3. Pairwise Test Generation from Cause-effect Graphs
  3.1. Problem Formulation
  3.2. Approaches for Pairwise Test Generation
 4. Experiments
 5. Concluding Remarks
 Acknowledgements
 References

키워드

저자

• Insang Chung [ Department of Computer Engineering, Hansung University, Seoul, Republic of Korea ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Software Engineering and Its Applications

• 간기

  월간

• pISSN

  1738-9984

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605