바로가기메뉴

본문 바로가기 주메뉴 바로가기
 

logo

  • P-ISSN1738-6764
  • E-ISSN2093-7504
  • KCI

Modeling Pairwise Test Generation from Cause-Effect Graphs as a Boolean Satisfiability Problem

INTERNATIONAL JOURNAL OF CONTENTS / INTERNATIONAL JOURNAL OF CONTENTS, (P)1738-6764; (E)2093-7504
2014, v.10 no.3, pp.41-46
https://doi.org/10.5392/ijoc.2014.10.3.041
Chung, Insang

Abstract

A cause-effect graph considers only the desired external behavior of a system by identifying input-output parameter relationships in the specification. When testing a software system with cause-effect graphs, it is important to derive a moderate number of tests while avoiding loss in fault detection ability. Pairwise testing is known to be effective in determining errors while considering only a small portion of the input space. In this paper, we present a new testing technique that generates pairwise tests from a cause-effect graph. We use a Boolean Satisbiability (SAT) solver to generate pairwise tests from a cause-effect graph. The Alloy language is used for encoding the cause-effect graphs and its SAT solver is applied to generate the pairwise tests. Using a SAT solver allows us to effectively manage constraints over the input parameters and facilitates the generation of pairwise tests, even in the situations where other techniques fail to satisfy full pairwise coverage.

keywords
Cause-Effect Graph, Pairwise Testing, Alloy, SAT problem, Requirements-based Testing

INTERNATIONAL JOURNAL OF CONTENTS