Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/654
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Z | - |
dc.contributor.author | Harman, M | - |
dc.contributor.author | Hierons, RM | - |
dc.coverage.spatial | 25 | en |
dc.date.accessioned | 2007-03-01T14:36:08Z | - |
dc.date.available | 2007-03-01T14:36:08Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Li, Z., Harman, M., Hierons, R.M. (2007) 'Search algorithms for regression test case prioritization', IEEE Transactions on Software Engineering, 33(4), pp. 225-237. doi:10.1109/TSE.2007.38. | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/654 | - |
dc.description.abstract | Regression testing is an expensive, but important, process. Unfortunately, there may be insufficient resources to allow for the re-execution of all test cases during regression testing. In this situation, test case prioritisation techniques aim to improve the effectiveness of regression testing, by ordering the test cases so that the most beneficial are executed first. Previous work on regression test case prioritisation has focused on Greedy Algorithms. However, it is known that these algorithms may produce sub-optimal results, because they may construct results that denote only local minima within the search space. By contrast, meta-heuristic and evolutionary search algorithms aim to avoid such problems. This paper presents results from an empirical study of the application of several greedy, meta-heuristic and evolutionary search algorithms to six programs, ranging from 374 to 11,148 lines of code for 3 choices of fitness metric. The paper addresses the problems of choice of fitness metric, characterisation of landscape modality and determination of the most suitable search technique to apply. The empirical results replicate previous results concerning Greedy Algorithms. They shed light on the nature of the regression testing search space, indicating that it is multi-modal. The results also show that Genetic Algorithms perform well, although Greedy approaches are surprisingly effective, given the multi-modal nature of the landscape. | en |
dc.format.extent | 3753457 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | IEEE | en |
dc.subject | Search techniques | en |
dc.subject | Test case prioritisation | en |
dc.subject | Regression testing | - |
dc.title | Search algorithms for regression test case prioritization | en |
dc.type | Research Paper | en |
dc.identifier.doi | https://doi.org/10.1109/TSE.2007.38 | - |
Appears in Collections: | Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC) Software Engineering (B-SERC) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 3.67 MB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.