Exact search-space size for the refactoring scheduling problem. Morales, R., Chicano, F., Khomh, F., & Antoniol, G. Automated Software Engineering, 25(2):195–200, 2018.
Exact search-space size for the refactoring scheduling problem [link]Paper  Exact search-space size for the refactoring scheduling problem [link]Paper  doi  abstract   bibtex   1 download  
Ouni et al. ``Maintainability defects detection and correction: a multi-objective approach'' proposed a search-based approach for generating optimal refactoring sequences. They estimated the size of the search space for the refactoring scheduling problem using a formulation that is incorrect; the search space is estimated to be too much larger than it is. We provide in this paper the exact expression for computing the number of possible refactoring sequences of a software system. This could be useful for researchers and practitioners interested in developing new approaches to automate refactoring.
@Article{Morales2017,
author="Morales, Rodrigo
and Chicano, Francisco
and Khomh, Foutse
and Antoniol, Giuliano",
title="Exact search-space size for the refactoring scheduling problem",
journal="Automated Software Engineering",
year="2018",
abstract="Ouni et al. ``Maintainability defects detection and correction: a multi-objective approach'' proposed a search-based approach for generating optimal refactoring sequences. They estimated the size of the search space for the refactoring scheduling problem using a formulation that is incorrect; the search space is estimated to be too much larger than it is. We provide in this paper the exact expression for computing the number of possible refactoring sequences of a software system. This could be useful for researchers and practitioners interested in developing new approaches to automate refactoring.",
issn="0928-8910",
pages = {195--200}, 
number = {2}, 
volume = {25}, 
doi="10.1007/s10515-017-0213-6",
url_Paper =    {http://rdcu.be/paOV},
url="https://doi.org/10.1007/s10515-017-0213-6"
}

Downloads: 1