Arrays for combinatorial interaction testing: a review on constructive approaches
Arrays for combinatorial interaction testing: a review on constructive approaches
复制标题
DOI：
10.1007/s42081-019-00056-w
复制
发表时间：
2019-08
影响因子：
1.3
通讯作者：
Xiaonan Lu;Masakazu Jimbo
中科院分区：
文献类型：
--
作者：
Xiaonan Lu;Masakazu Jimbo
在过去的几十年里，人们从各个方面对基于组件的复杂系统中的交互故障进行了研究。问题的关键在于，在复杂系统中，不仅单个变量可能导致失效，而且多个变量之间的相互作用也可能导致失效。组合交互测试是识别和定位错误交互的最基本、最有效的工具之一。本文综述了组合交互作用测试阵列的发展简史、基本问题和重要结果，包括覆盖阵列、定位阵列、检测阵列及其变体。回顾了涉及信息论方法的覆盖阵列显式构造的具体方法。最后，我们提出了两个改进的边界研究的最优性定位阵列。
Interaction faults in component-based complex systems have been investigated from various aspects in the past few decades. The key issue is that, in a complex system, not only a single variable may cause the failure, but also the interactions among different variables. Combinatorial interaction testing has been established as one of the most fundamental and effective tools for identifying and locating the faulty interactions. This paper presents a review of the brief history, essential problems, and significant results on arrays for combinatorial interaction testing, including covering arrays, locating arrays, detecting arrays, and their variations. Specific approaches on explicit constructions for covering arrays involving information-theoretic methods are reviewed. Finally, we propose two improved bounds for studying the optimality of locating arrays.