Constructing Test Sets for Pairwise Testing: A SAT-Based Approach

摘要

In this paper pair wise testing, a well-practiced software testing method, is discussed. Specifically an automatic test generation approach is proposed for this particular testing method. The proposed approach makes full use of a boolean satisfiability solver (SAT solver). Due to recent rapid advance, modern SAT solvers are able to handle very large problem instances. Using a SAT solver thus allows us both to efficiently find hidden constraints on possible tests and to search for a good test set.