THE MULTI-OBJECTIVE REFACTORING SELECTION PROBLEM

被引：0

作者：

Chisalita-Cretu, Camelia ^{[1
]}

Vescan, Andreea ^{[1
]}

机构：

[1] Univ Babes Bolyai, Fac Math & Comp Sci, Dept Comp Sci, R-3400 Cluj Napoca, Romania

来源：

KEPT 2009: KNOWLEDGE ENGINEERING PRINCIPLES AND TECHNIQUES | 2009年

关键词：

searched-based software engineering; multi-objective optimization; refactoring;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The paper defines the Optimal Refactoring Selection Problem (ORSP) and generalizes it as a Multi-Objective ORSP (MOORSP) by treating the cost constraint as an objective and combining it with the effect objective. It considers the refactoring selection as a multi-objective optimization in the Search-Based Software Engineering (SBSE) field. The results of the proposed weighted objective genetic algorithm on an experimental didactic case study are presented and compared with other recommended solutions for similar problems.

引用

页码：291 / 298

页数：8

共 7 条

[1]

BOWMAN M, 2007, 23 IEEE INT C SOFTW, P135

[2]

DEMEYER S, 2002, SIMULATION LAN ELECT, V72, P34

[3]

Fatiregun D, 2004, FOURTH IEEE INTERNATIONAL WORKSHOP ON SOURCE CODE ANALYSIS AND MANIPULATION, PROCEEDINGS, P65

[4]

Fowler M., 2018, Refactoring: Improving the Design of Existing Code

[5] Adaptive weighted-sum method for bi-objective optimization: Pareto front generation [J].

Kim, IY ;

de Weck, OL .

STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2005, 29 (02) :149-158

[6] Analysing refactoring dependencies using graph transformation [J].

Mens, Tom ;

Taentzer, Gabriele ;

Runge, Olga .

SOFTWARE AND SYSTEMS MODELING, 2007, 6 (03) :269-285

[7]

Seng O, 2006, GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, P1909

← 1 →