A Bi-objective Model Inspired Greedy Algorithm for Test Suite Minimization
Regression testing is a critical activity which occurs during the maintenance stage of the software lifecycle. However, it requires large amounts of test cases to assure the attainment of a certain degree of quality. As a result, test suite sizes may grow significantly. To address this issue, Test Suite Reduction techniques have been proposed. However, suite size reduction may lead to significant loss of fault detection efficacy. To deal with this problem, a greedy algorithm is presented in this paper. This algorithm attempts to select a test case which satisfies the maximum number of testing requirements while having minimum overlap in requirements coverage with other test cases. In order to evaluate the proposed algorithm, experiments have been conducted on the Siemens suite and the Space program. The results demonstrate the effectiveness of the proposed algorithm by retaining the fault detection capability of the suites while achieving significant suite size reduction.
KeywordsSoftware regression testing testing criteria test suite minimization test suite reduction fault detection effectiveness
Unable to display preview. Download preview PDF.
- 2.Rothermel, G., Harrold, M.J., Ostrin, J., Hong, C.: An Empirical Study of the Effects of Minimization on the Fault Detection Capabilities of Test Suites. In: Proceedings of the International Conference on Software Maintenance. IEEE Computer Society, Los Alamitos (1998)Google Scholar
- 4.Chen, T.Y., Lau, M.F.: Heuristics toward the Optimization of the Size of a Test Suite. In: Proc. 3rd Int’l. Conf. on Softw. Quality Management, Seville, Spain, April 1995, vol. 2, pp. 415–424 (1995)Google Scholar
- 7.Tallam, S., Gupta, N.: A concept analysis inspired greedy algorithm for test suite minimization. In: Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering. ACM, Lisbon (2005)Google Scholar
- 8.Leon, D., Podgurski, A.: A Comparison of Coverage-Based and Distribution-Based Techniques for Filtering and Prioritizing Test Cases. In: Proceedings of the 14th International Symposium on Software Reliability Engineering. IEEE Computer Society, Los Alamitos (2003)Google Scholar
- 9.Chen, Z., Xu, B., Zhang, X., Nie, C.: A novel approach for test suite reduction based on requirement relation contraction. In: Proceedings of the 2008 ACM symposium on applied computing. ACM, Fortaleza (2008)Google Scholar
- 11.Chen, T.Y., Lau, M.: A new heuristic for test suite reduction. Information and Software Technology 40(5-6) (1998)Google Scholar
- 14.Black, J., Melachrinoudis, E., Kaeli, D.: Bi-Criteria Models for All-Uses Test Suite Reduction. In: Proceedings of the 26th International Conference on Software Engineering. IEEE Computer Society, Los Alamitos (2004)Google Scholar
- 15.Rothermel, G., Elbaum, S., Kinneer, A., Do, H.: Software-artifact infrastructure repository, http://www.cse.unl.edu/~galileo/sir
- 16.SAS 9.1.3 Documentation, SAS/GRAPH 9.1 Reference, http://support.sas.com/documentation/onlinedoc/91pdf/index_913.html