Aggregate-strength interaction test suite prioritization

Elsevier

Combinatorial interaction testing is a widely used approach. In testing, it is often assumed that all combinatorial test cases have equal fault detection capability, however it has been shown that the execution order of an interaction test suite's test cases may be critical, especially when the testing resources are limited. To improve testing cost-effectiveness, test cases in the interaction test suite can be prioritized, and one of the best-known categories of prioritization approaches is based on “fixed-strength prioritization”, which prioritizes an interaction test suite by choosing new test cases which have the highest uncovered interaction coverage at a fixed strength (level of interaction among parameters). A drawback of these approaches, however, is that, when selecting each test case, they only consider a fixed strength, not multiple strengths. To overcome this, we propose a new “aggregate-strength prioritization”, to combine interaction coverage at different strengths. Experimental results show that in most cases our method performs better than the test-case-generation, reverse test-case-generation, and random prioritization techniques. The method also usually outperforms “fixed-strength prioritization”, while maintaining a similar time cost.

Software testing; combinatorial interaction testing; test case prioritization; interaction coverage; fixed-strength prioritization; aggregate-strength prioritization;algorithm; Article; PeerReviewed

10.1016.j.jss.2014.09.002

Open access content. Open access content

doi:10.1016/j.jss.2014.09.002

UVN oai:eprints.nottingham.ac.uk:51753
Huang, Rubing, Chen, Jinfu, Towey, Dave, Chan, Alvin T.S. and Lu, Yansheng (2015) Aggregate-strength interaction test suite prioritization. Journal of Systems and Software, 99 . pp. 36-51. ISSN 0164-1212
doi:10.1016/j.jss.2014.09.002
1358479394

UNIV OF NOTTINGHAM
From OAIster®, provided by the OCLC Cooperative.

edsoai.on1358479394