DocumentCode
1851899
Title
Adaptive Random Test Case Prioritization
Author
Jiang, Bo ; Zhang, Zhenyu ; Chan, W.K. ; Tse, T.H.
Author_Institution
Univ. of Hong Kong, Hong Kong, China
fYear
2009
fDate
16-20 Nov. 2009
Firstpage
233
Lastpage
244
Abstract
Regression testing assures changed programs against unintended amendments. Rearranging the execution order of test cases is a key idea to improve their effectiveness. Paradoxically, many test case prioritization techniques resolve tie cases using the random selection approach, and yet random ordering of test cases has been considered as ineffective. Existing unit testing research unveils that adaptive random testing (ART) is a promising candidate that may replace random testing (RT). In this paper, we not only propose a new family of coverage-based ART techniques, but also show empirically that they are statistically superior to the RT-based technique in detecting faults. Furthermore, one of the ART prioritization techniques is consistently comparable to some of the best coverage-based prioritization techniques (namely, the "additional" techniques) and yet involves much less time cost.
Keywords
fault diagnosis; program testing; regression analysis; software engineering; adaptive random test case prioritization; coverage based ART techniques; fault detection; random selection; regression testing; Australia Council; Automatic testing; Computer science; Costs; Fault detection; Greedy algorithms; Programming; Software engineering; Software testing; Subspace constraints; Adaptive random testing; test case prioritization;
fLanguage
English
Publisher
ieee
Conference_Titel
Automated Software Engineering, 2009. ASE '09. 24th IEEE/ACM International Conference on
Conference_Location
Auckland
ISSN
1938-4300
Print_ISBN
978-1-4244-5259-0
Electronic_ISBN
1938-4300
Type
conf
DOI
10.1109/ASE.2009.77
Filename
5431769
Link To Document