The Community for Technology Leaders
2013 IEEE International Conference on Software Maintenance (2006)
Philadelphia, Pennsylvania
Sept. 24, 2006 to Sept. 27, 2006
ISSN: 1063-6773
ISBN: 0-7695-2354-4
pp: 176-185
Mark Harman , Motorola Labs, Viables Estate, UK
Kathleen Steinhofel , Motorola Labs, Viables Estate, UK
Alexandros Skaliotis , Motorola Labs, Viables Estate, UK
Paul Baker , Motorola Labs, Viables Estate, UK
ABSTRACT
This paper addresses the problem of determining the next set of releases in the course of software evolution. It formulates both ranking and selection of candidate software components as a series of feature subset selection problems to which search based software engineering can be applied. The approach is automated using greedy and simulated annealing algorithms and evaluated using a set of software components from the component base of a large telecommunications organisation. The results are compared to those obtained by a panel of (human) experts. The results show that the two automated approaches convincingly outperform the expert judgment approach.
INDEX TERMS
null
CITATION
Mark Harman, Kathleen Steinhofel, Alexandros Skaliotis, Paul Baker, "Search Based Approaches to Component Selection and Prioritization for the Next Release Problem", 2013 IEEE International Conference on Software Maintenance, vol. 00, no. , pp. 176-185, 2006, doi:10.1109/ICSM.2006.56
97 ms
(Ver )