Paper Info
Title
Assessing single-objective performance convergence and time complexity for refactoring detection.
Abstract
The automatic detection of refactoring recommendations has been tackled in prior optimization studies involving bad code smells, semantic coherence and importance of classes; however, such studies informally addressed formalisms to standardize and replicate refactoring models. We propose to assess the refactoring detection by means of performance convergence and time complexity. Since the reported approaches are difficult to reproduce, we employ an Artificial Refactoring Generation (ARGen) as a formal and naive computational solution for the Refactoring Detection Problem. ARGen is able to detect massive refactoring's sets in feasible areas of the search space. We used a refactoring formalization to adapt search techniques (Hill Climbing, Simulated Annealing and Hybrid Adaptive Evolutionary Algorithm) that assess the performance and complexity on three open software systems. Combinatorial techniques are limited in solving the Refactoring Detection Problem due to the relevance of developers' criteria (human factor) when designing reconstructions. Without performance convergence and time complexity analysis, a software empirical analysis that utilizes search techniques is incomplete.
Year
Venue
Field
2018
GECCO (Companion)
Simulated annealing,Hill climbing,Evolutionary algorithm,Computer science,Combinatorial optimization,Artificial intelligence,Software maintenance,Time complexity,Code refactoring,Code smell,Machine learning
DocType
ISBN
Citations 
Conference
978-1-4503-5764-7
0
PageRank 
References 
Authors
0.34
20
3
Name
Order
Citations
PageRank
David Nader-Palacio100.34
Daniel Rodríguez-Cárdenas200.34
Jonatan Gómez324129.70