A Survey of Binary Covering Arrays
A Survey of Binary Covering Arrays
复制标题
DOI：
10.37236/571
复制
发表时间：
2011-04
期刊：
影响因子：
--
通讯作者：
R. Kacker;Yu Lei;D. R. Kuhn;J. Lawrence;George Mason;Michael A. Forbes
中科院分区：
文献类型：
--
作者：
R. Kacker;Yu Lei;D. R. Kuhn;J. Lawrence;George Mason;Michael A. Forbes
强度为$t$的二进制覆盖数组是0-1矩阵，具有以下性质：对于每个$t$列和每个可能的$t $0和1的$2^t$序列，在该$t$列的集合中存在具有该序列的行。覆盖数组在某些应用中是一个重要的工具，例如在软件测试中。在这些应用中，矩阵的列数由应用规定，并且期望具有具有少量行的覆盖阵列。在这里，我们调查一些已知的存在的二进制覆盖数组和方法，生产他们，包括显式的建设和搜索技术。
Binary covering arrays of strength $t$ are 0–1 matrices having the property that for each $t$ columns and each of the possible $2^t$ sequences of $t$ 0's and 1's, there exists a row having that sequence in that set of $t$ columns. Covering arrays are an important tool in certain applications, for example, in software testing. In these applications, the number of columns of the matrix is dictated by the application, and it is desirable to have a covering array with a small number of rows. Here we survey some of what is known about the existence of binary covering arrays and methods of producing them, including both explicit constructions and search techniques.