A density-based greedy algorithm for higher strength covering arrays
A density-based greedy algorithm for higher strength covering arrays
复制标题
DOI：
10.1002/stvr.393
复制
发表时间：
2009-03-01
影响因子：
1.5
通讯作者：
Colbourn, Charles J.
中科院分区：
文献类型：
--
作者：
Bryce, Renee C.;Colbourn, Charles J.
软件交互测试用例集的算法构造主要集中在两两覆盖上，对于t>；=3的t-way交互测试用例集的有效构造知之甚少。该研究扩展了一种基于密度的两向交互测试用例集生成算法，并证明了该算法保证了测试用例集大小与因素数成对数上界。为了补充这一理论保证，本文概述了一种实现方法，并对其进行了一些实际改进。报告了与其他已发表方法的计算比较。许多结果都比文献中的结果更好。然而，也确定了一次一次测试算法的能力的限制。版权所有(C)2008 John Wiley&Sons，Ltd.
Algorithmic construction of software interaction test suites has focussed on pairwise coverage, less is known about the efficient construction of test suites for t-way interactions with t >= 3. This study extends an efficient density-based algorithm for pairwise coverage to generate t-way interaction test suites and shows that it guarantees a logarithmic upper bound on the size of the test suites as a function of the number of factors. To complement this theoretical guarantee, an implementation is outlined and some practical improvements are made. Computational comparisons with other published methods are reported. Many of the results improve upon those in the literature. However, limitations on the ability of one-test-at-a-time algorithms are also identified. Copyright (C) 2008 John Wiley & Sons, Ltd.