← Back to VOLUME 3, ISSUE 5, MAY 2014
This work is licensed under a Creative Commons Attribution 4.0 International License.
Detection of Optimal Refactoring Plans For Resolution of Code Smells
PANDIYAVATHI.T, MANOCHANDAR.T Student M.E. (SWE), Anna University, Chennai, India Assistant Professor, VRS College of Engineering & Technology, Arasur, India
Downloads: Download PDF
π 52 viewsπ₯ 0 downloads
Abstract: Bad smells can be detected using various kinds of automated tools. The problem behind this is clear, where the smell being refactored may have dependency in increasing or resolving some other kind of smell which in turn results in increased effort and time. A smell being resolved may affect the presence of an existing smell or introduces some more conflicts into the system. The works discussed in the literature leads to lot of human effort and enormous amount of maintenance time. In order to reduce the manual work load and to obtain the better source code for easy maintenance and to obtain a better refactoring sequence this work proposes optimal refactoring plans that enhances detection and sequencing of bad smells. The selected code smells are sequenced to avoid RIPPLE EFFECT. The refactoring methods that have to be applied to the source code are also ordered based on the fitness criteria using a genetic algorithm.
How to Cite:
[1] PANDIYAVATHI.T, MANOCHANDAR.T Student M.E. (SWE), Anna University, Chennai, India Assistant Professor, VRS College of Engineering & Technology, Arasur, India, βDetection of Optimal Refactoring Plans For Resolution of Code Smells,β International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)
