Prioritized interaction testing for pair-wise coverage with seeding and constraints
Prioritized interaction testing for pair-wise coverage with seeding and constraints
复制标题
DOI：
10.1016/j.infsof.2006.03.004
复制
发表时间：
2006-10-01
影响因子：
3.9
通讯作者：
Colbourn, Charles J.
中科院分区：
文献类型：
--
作者：
Bryce, Renee C.;Colbourn, Charles J.
交互测试被广泛应用于故障筛选。在软件测试中，它为测试部署在各种硬件和软件配置上的系统提供了一种自然的机制。在许多需要交互测试的应用程序中，由于时间或预算的限制，整个测试套件并没有运行。在这些情况下，确定测试的优先顺序至关重要。这里，我们采用“一次测试”的贪婪方法来考虑配对的重要性。该方法可用于按顺序生成一组测试，以便当运行到完成时测试所有成对交互，但是当在任何中间数量的测试之后终止时，那些被认为最重要的被测试。此外，还解决了播种和避免的实际问题。给出了计算结果。(C)2006爱思唯尔B.V.保留所有权利。
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and software configurations. In many applications where interaction testing is needed, the entire test suite is not run as a result of time or budget constraints. In these situations, it is essential to prioritize the tests. Here, we adapt a "one-test-at-a-time" greedy method to take importance of pairs into account. The method can be used to generate a set of tests in order, so that when run to completion all pair-wise interactions are tested, but when terminated after any intermediate number of tests, those deemed most important are tested. In addition, practical concerns of seeding and avoids are addressed. Computational results are reported. (c) 2006 Elsevier B.V. All rights reserved.