Identifying extract-method refactoring candidates automatically

Authors:
Tushar Sharma
Affiliations:
Siemens Corporate Research and Technologies, Bangalore, India
Venue:
Proceedings of the Fifth Workshop on Refactoring Tools
Year:
2012

Citing 6
Cited 0

Automated method-extraction refactoring by using block-based slicing

SSR '01 Proceedings of the 2001 symposium on Software reusability: putting software reuse in context
Control flow analysis

Proceedings of a symposium on Compiler optimization
Effective, Automatic Procedure Extraction

IWPC '03 Proceedings of the 11th IEEE International Workshop on Program Comprehension
Drivers for software refactoring decisions

Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering
Structured design

Classics in software engineering
Identification of Extract Method Refactoring Opportunities

CSMR '09 Proceedings of the 2009 European Conference on Software Maintenance and Reengineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Refactoring becomes an essential activity in software development process especially for large and long life projects. Extract-method is one of the most frequently used refactorings to address code smells such as long and incohesive methods, and duplicated code. Automated means of identifying opportunities for refactoring can make the software development process faster and more efficient. In this paper, an abstraction for methods viz. Data and Structure Dependency (DSD) graph and an algorithm viz. longest edge removal algorithm to find extract-method refactoring candidates is proposed.