TY - JOUR
T1 - Prioritized interaction testing for pair-wise coverage with seeding and constraints
AU - Bryce, Renée C.
AU - Colbourn, Charles
N1 - Funding Information:
This research is supported by the Consortium for Embedded and Internetworking Technologies and by ARO Grant DAAD 19-1-01-0406.
PY - 2006/10
Y1 - 2006/10
N2 - 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.
AB - 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.
KW - Biased covering arrays
KW - Covering arrays
KW - Greedy algorithm
KW - Mixed-level covering arrays
KW - Pair-wise interaction coverage
KW - Software interaction testing
KW - Test prioritization
UR - http://www.scopus.com/inward/record.url?scp=33748467305&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33748467305&partnerID=8YFLogxK
U2 - 10.1016/j.infsof.2006.03.004
DO - 10.1016/j.infsof.2006.03.004
M3 - Article
AN - SCOPUS:33748467305
SN - 0950-5849
VL - 48
SP - 960
EP - 970
JO - Information and Software Technology
JF - Information and Software Technology
IS - 10
ER -