Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints

Toru NANBA; Tatsuhiro TSUCHIYA; Tohru KIKUNO

doi:10.1587/transfun.E95.A.1501

Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints

Toru NANBA, Tatsuhiro TSUCHIYA, Tohru KIKUNO

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.9 pp.1501-1505

Publication Date: 2012/09/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E95.A.1501

Type of Manuscript: Special Section LETTER (Special Section on Software Reliability Engineering)

Category

Cite this

Copy

Toru NANBA, Tatsuhiro TSUCHIYA, Tohru KIKUNO, "Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints" in IEICE TRANSACTIONS on Fundamentals, vol. E95-A, no. 9, pp. 1501-1505, September 2012, doi: 10.1587/transfun.E95.A.1501.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.1501/_p

Copy

@ARTICLE{e95-a_9_1501,
author={Toru NANBA, Tatsuhiro TSUCHIYA, Tohru KIKUNO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints},
year={2012},
volume={E95-A},
number={9},
pages={1501-1505},
abstract={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.},
keywords={},
doi={10.1587/transfun.E95.A.1501},
ISSN={1745-1337},
month={September},}

Copy

TY - JOUR
TI - Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1501
EP - 1505
AU - Toru NANBA
AU - Tatsuhiro TSUCHIYA
AU - Tohru KIKUNO
PY - 2012
DO - 10.1587/transfun.E95.A.1501
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2012
AB - 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.
ER -