Finding Minimum Locating Arrays Using a SAT Solver
Finding Minimum Locating Arrays Using a SAT Solver
复制标题
DOI：
10.1109/icstw.2017.49
复制
发表时间：
2017-03
期刊：
影响因子：
--
通讯作者：
Tatsuya Konishi;Hideharu Kojima;Hiroyuki Nakagawa;Tatsuhiro Tsuchiya
中科院分区：
文献类型：
--
作者：
Tatsuya Konishi;Hideharu Kojima;Hiroyuki Nakagawa;Tatsuhiro Tsuchiya
定位阵列提供组合测试套件，不仅用于检测交互故障的存在，还用于定位故障。然而，与普通组合测试的测试用例相比，故障定位能力需要大幅增加测试用例的大小。在这份立场文件中，我们考虑了这样一个问题：定位数组可以有多小？为了回答这个问题，我们开发了一种使用SAT求解器查找给定大小的定位数组的方法。我们报告了使用我们的方法发现的最小定位阵列的大小。这一结果提供了最小定位数组大小的已知最小上界。
Locating arrays provide combinatorial test suites not only for detecting the presence of an interaction fault but also for locating the fault. Compared with test suites for ordinary combinatorial testing, however, the fault locating capabilityentails a substantial increase in the size of test suites. In this position paper, we consider the problem: how small can locating arrays be? To answer the question, we develop a method that finds a locating array of a given size using a SAT solver. We report the size of the smallest locating arrays discovered by using our method. This result provides the smallest known upper bound on the size of the minimum locating arrays.