当前位置: X-MOL 学术Automat. Softw. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Exact search-space size for the refactoring scheduling problem
Automated Software Engineering ( IF 3.4 ) Pub Date : 2017-02-10 , DOI: 10.1007/s10515-017-0213-6
Rodrigo Morales , Francisco Chicano , Foutse Khomh , Giuliano Antoniol

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.

中文翻译:

重构调度问题的精确搜索空间大小

欧尼等人。“可维护性缺陷检测和纠正:一种多目标方法”提出了一种基于搜索的方法来生成最佳重构序列。他们使用不正确的公式估计了重构调度问题的搜索空间大小;搜索空间估计比它大太多。我们在本文中提供了计算软件系统可能重构序列数量的精确表达式。这对于有兴趣开发自动化重构的新方法的研究人员和从业者可能很有用。
更新日期:2017-02-10
down
wechat
bug