The Community for Technology Leaders
Green Image
Issue No. 04 - July-Aug. (2012 vol. 38)
ISSN: 0098-5589
pp: 936-956
Siavash Mirarab , University of Texas at Austin, Austin
Soroush Akhlaghi , Shahed University, Tehran
Ladan Tahvildari , University of Waterloo, Waterloo
To ensure that a modified software system has not regressed, one approach is to rerun existing test cases. However, this is a potentially costly task. To mitigate the costs, the testing effort can be optimized by executing only a selected subset of the test cases that are believed to have a better chance of revealing faults. This paper proposes a novel approach for selecting and ordering a predetermined number of test cases from an existing test suite. Our approach forms an Integer Linear Programming problem using two different coverage-based criteria, and uses constraint relaxation to find many close-to-optimal solution points. These points are then combined to obtain a final solution using a voting mechanism. The selected subset of test cases is then prioritized using a greedy algorithm that maximizes minimum coverage in an iterative manner. The proposed approach has been empirically evaluated and the results show significant improvements over existing approaches for some cases and comparable results for the rest. Moreover, our approach provides more consistency compared to existing approaches.
Software regression testing, test case selection, integer programming, Pareto optimality

S. Mirarab, S. Akhlaghi and L. Tahvildari, "Size-Constrained Regression Test Case Selection Using Multicriteria Optimization," in IEEE Transactions on Software Engineering, vol. 38, no. , pp. 936-956, 2011.
174 ms
(Ver 3.3 (11022016))