Proceedings of the 24th IEEE/ACM International Conference on Automated Software Engineering (ASE '09),
IEEE Computer Society Press, Los Alamitos, CA (2009)

Adaptive Random Test Case Prioritization 1

Bo Jiang 2 , Zhenyu Zhang 2 , W.K. Chan 3 , and T.H. Tse 2

[paper from IEEE Xplore | paper from IEEE digital library | technical report TR-2009-18]


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: Adaptive random testing; test case prioritization

1. This research is supported in part by the General Research Fund of the Research Grants Council of Hong Kong (project nos. 123207 and 716507) and a discovery grant of the Australian Research Council (project no. DP0984760).
2. Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong.
3. (Corresponding author.)
Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Hong Kong.


  Cumulative visitor count