Stepping stones over the refactoring rubicon lightweight language extensions to easily realise refactorings

37Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Refactoring tools allow the programmer to pretend they are working with a richer language where the behaviour of a program is automatically preserved during restructuring. In this paper we show that this metaphor of an extended language yields a very general and useful implementation technique for refactorings: a refactoring is implemented by embedding the source program into an extended language on which the refactoring operations are easier to perform, and then translating the refactored program back into the original language. Using the well-known Extract Method refactoring as an example, we show that this approach allows a very fine-grained decomposition of the overall refactoring into a series of micro-refactorings that can be understood, implemented, and tested independently. We thus can easily write implementations of complex refactorings that rival and even outperform industrial strength refactoring tools in terms of correctness, but are much shorter and easier to understand. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Schäfer, M., Verbaere, M., Ekman, T., & De Moor, O. (2009). Stepping stones over the refactoring rubicon lightweight language extensions to easily realise refactorings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5653 LNCS, pp. 369–393). https://doi.org/10.1007/978-3-642-03013-0_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free