Empirical Evaluation of Pareto Efficient Multi-objective Regression Test Case Prioritisation

TitleEmpirical Evaluation of Pareto Efficient Multi-objective Regression Test Case Prioritisation
Publication TypeConference Paper
Year of Publication2015
AuthorsEpitropakis, MG, Yoo, S, Harman, M, Burke, EK
Conference NameInternational Symposium on Software Testing and Analysis (ISSTA'15)
Conference LocationBaltimore, MD, USA
Keywordsadditional greedy algorithm, coverage compaction, multi-objective evolutionary algo- rithm, Test case prioritization

The aim of test case prioritisation is to determine an ordering of test cases that maximises the likelihood of early fault revelation. Previous prioritisation techniques have tended to be single objective, for which the additional greedy algorithm is the current state-of-the-art. Unlike test suite minimisation, multi objective test case prioritisation has not been thoroughly evaluated. This paper presents an extensive empirical study of the effectiveness of multi objective test case prioritisation, evaluating it on multiple versions of five widely-used benchmark programs and a much larger real world system of over 1 million lines of code. The paper also presents a lossless coverage compaction algorithm that dramatically scales the performance of all algorithms studied by between 2 and 4 orders of magnitude, making prioritisation practical for even very demanding problems.

PDF icon it.pdf434.42 KB

Scholarly Lite is a free theme, contributed to the Drupal Community by More than Themes.