Coverage-based clustering and scheduling approach for test case prioritization

9Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

Regression testing is essential for assuring the quality of a software product. Because rerunning all test cases in regression testing may be impractical under limited resources, test case prioritization is a feasible solution to optimize regression testing by reordering test cases for the current testing version. In this paper, we propose a novel test case prioritization approach that combines the clustering algorithm and the scheduling algorithm for improving the effectiveness of regression testing. By using the clustering algorithm, test cases with same or similar properties are merged into a cluster, and the scheduling algorithm helps allocate an execution priority for each test case by incorporating fault detection rates with the waiting time of test cases in candidate set. We have conducted several experiments on 12 C programs to validate the effectiveness of our proposed approach. Experimental results show that our approach is more effective than some well studied test case prioritization techniques in terms of average percentage of fault detected (APFD) values.

Cite

CITATION STYLE

APA

Fu, W., Yu, H., Fan, G., & Ji, X. (2017). Coverage-based clustering and scheduling approach for test case prioritization. IEICE Transactions on Information and Systems, E100D(6), 1218–1230. https://doi.org/10.1587/transinf.2016EDP7356

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free