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.
Paper
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
{"_id":"GgRqR8ZAPi2S9C8rL","bibbaseid":"morales-chicano-khomh-antoniol-exactsearchspacesizefortherefactoringschedulingproblem-2018","author_short":["Morales, R.","Chicano, F.","Khomh, F.","Antoniol, G."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Morales"],"firstnames":["Rodrigo"],"suffixes":[]},{"propositions":[],"lastnames":["Chicano"],"firstnames":["Francisco"],"suffixes":[]},{"propositions":[],"lastnames":["Khomh"],"firstnames":["Foutse"],"suffixes":[]},{"propositions":[],"lastnames":["Antoniol"],"firstnames":["Giuliano"],"suffixes":[]}],"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","bibtex":"@Article{Morales2017,\r\nauthor=\"Morales, Rodrigo\r\nand Chicano, Francisco\r\nand Khomh, Foutse\r\nand Antoniol, Giuliano\",\r\ntitle=\"Exact search-space size for the refactoring scheduling problem\",\r\njournal=\"Automated Software Engineering\",\r\nyear=\"2018\",\r\nabstract=\"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.\",\r\nissn=\"0928-8910\",\r\npages = {195--200}, \r\nnumber = {2}, \r\nvolume = {25}, \r\ndoi=\"10.1007/s10515-017-0213-6\",\r\nurl_Paper = {http://rdcu.be/paOV},\r\nurl=\"https://doi.org/10.1007/s10515-017-0213-6\"\r\n}\r\n\r\n","author_short":["Morales, R.","Chicano, F.","Khomh, F.","Antoniol, G."],"key":"Morales2017","id":"Morales2017","bibbaseid":"morales-chicano-khomh-antoniol-exactsearchspacesizefortherefactoringschedulingproblem-2018","role":"author","urls":{" paper":"http://rdcu.be/paOV","Paper":"https://doi.org/10.1007/s10515-017-0213-6"},"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"article","biburl":"https://moar82.github.io/myPapers/moralesBib.bib","dataSources":["SnNYgSkXkvyAsckPN"],"keywords":[],"search_terms":["exact","search","space","size","refactoring","scheduling","problem","morales","chicano","khomh","antoniol"],"title":"Exact search-space size for the refactoring scheduling problem","year":2018,"downloads":1}