Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1587/transfun.E95.A.1501 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
SAT, software testing, pairwise testing, test set generation, constraints | Discrete mathematics,Satisfiability,All-pairs testing,Algorithm,Theoretical computer science,Model-based testing,Mathematics,Software testing | Journal |
Volume | Issue | ISSN |
E95A | 9 | 0916-8508 |
Citations | PageRank | References |
8 | 0.57 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toru Nanba | 1 | 9 | 0.91 |
| Tatsuhiro Tsuchiya | 2 | 455 | 52.76 |
| Tohru Kikuno | 3 | 8 | 0.57 |