Rights statement: © Authors, 2015. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in ISSTA 2015 Proceedings of the 2015 International Symposium on Software Testing and Analysis http://dx.doi.org/10.1145/2771783.2771788
Accepted author manuscript, 357 KB, PDF document
Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License
Final published version
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
| Publication date | 13/07/2015 |
|---|---|
| Host publication | ISSTA 2015 Proceedings of the 2015 International Symposium on Software Testing and Analysis |
| Place of Publication | New York |
| Publisher | ACM |
| Pages | 234-245 |
| Number of pages | 12 |
| ISBN (electronic) | 9781450336208 |
| <mark>Original language</mark> | English |
| Event | 24th International Symposium on Software Testing and Analysis, ISSTA 2015 - Baltimore, United States Duration: 13/07/2015 → 17/07/2015 |
| Conference | 24th International Symposium on Software Testing and Analysis, ISSTA 2015 |
|---|---|
| Country/Territory | United States |
| City | Baltimore |
| Period | 13/07/15 → 17/07/15 |
| Conference | 24th International Symposium on Software Testing and Analysis, ISSTA 2015 |
|---|---|
| Country/Territory | United States |
| City | Baltimore |
| Period | 13/07/15 → 17/07/15 |
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. Copyright is held by the owner/author(s).