Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints

Toru NANBA  Tatsuhiro TSUCHIYA  Tohru KIKUNO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E95-A   No.9   pp.1501-1505
Publication Date: 2012/09/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E95.A.1501
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Software Reliability Engineering)
SAT,  software testing,  pairwise testing,  test set generation,  constraints,  

Full Text: PDF(86.8KB)>>
Buy this Article

This letter discusses the applicability of boolean satisfiability (SAT) solving to pairwise testing in practice. Due to its recent rapid advance, using SAT solving seems a promising approach for search-based testing and indeed has already been practiced in test generation for pairwise testing. The previous approaches use SAT solving either for finding a small test set in the absence of parameter constraints or handling constraints, but not for both. This letter proposes an approach that uses a SAT solver for constructing a test set for pairwise testing in the presence of parameter constraints. This allows us to make full use of SAT solving for pairwise testing in practice.