A Satisfiability-Based Approach to Generation of Constrained Locating Arrays
A Satisfiability-Based Approach to Generation of Constrained Locating Arrays
复制标题
DOI：
10.1109/icstw.2018.00062
复制
发表时间：
2018-04
期刊：
影响因子：
--
通讯作者：
Hao Jin;Takashi Kitamura;Eun-Hye Choi;Tatsuhiro Tsuchiya
中科院分区：
文献类型：
--
作者：
Hao Jin;Takashi Kitamura;Eun-Hye Choi;Tatsuhiro Tsuchiya
定位数组是一种数学对象，旨在用于组合交互测试中的故障定位。然而，将其应用于现实世界的测试是困难的，因为被测系统中的测试参数值之间的约束。测试用例必须满足这样的约束才能被执行;但是定位数组的定义不考虑约束。因此，直接使用定位数组作为测试套件会导致未测试的交互以及无法识别的错误交互。在本文中，我们提出了一种方法来生成约束定位数组（CLAs），这是一个约束感知的扩展定位数组。该方法使用可满足性模理论（SMT）求解器搜索CLA。实验结果表明，该方法往往是足够快，找到一个最小的CLA为非平凡的情况。
A locating array is a mathematical object that is intended to be used for fault localization in combinatorial interaction testing. However, applying it to a real-world testing is difficult because a system under test often has constraints among test parameter values. Test cases must satisfy such constraints to be executed; but the definition of locating arrays does not consider constraints. Hence directly using a locating array as a test suite results in interactions that are not tested as well as faulty interactions that cannot be identified. In this paper, we propose a method of generating Constrained Locating Arrays (CLAs), which are a constraint-aware extension of locating arrays. The proposed method uses a Satisfiability Modulo Theories (SMT) solver to search for a CLA. Experimental results show that the proposed method is often fast enough to find a minimum CLA for a nontrivial case.