Constructing Test Sets for Pairwise Testing: A SAT-Based Approach
Constructing Test Sets for Pairwise Testing: A SAT-Based Approach
复制标题
DOI：
10.1109/icnc.2011.49
复制
发表时间：
2011-11
期刊：
影响因子：
--
通讯作者：
Toru Nanba;Tatsuhiro Tsuchiya;T. Kikuno
中科院分区：
文献类型：
--
作者：
Toru Nanba;Tatsuhiro Tsuchiya;T. Kikuno
在本文中，讨论了一种练习良好的软件测试方法的明智测试。特别是针对这种特定测试方法提出了一种自动测试生成方法。拟议的方法充分利用了布尔可满足求解器（SAT求解器）。由于最近的快速进步，现代SAT求解器能够处理非常大的问题实例。因此，使用SAT求解器使我们既可以在可能的测试上有效地找到隐藏的约束，并搜索良好的测试集。
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.