A refactoring constraint language and its application to eiffel

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

Abstract

We generalize previous work on constraint-based refactoring and develop it into the definition of a constraint language allowing the specification of refactorings in a completely declarative way. We present a compiler that transforms specifications in our language to plug-ins for an IDE that, together with an accompanying framework providing the necessary infrastructure, implement the specified refactoring tools. We evaluate our approach by presenting specifications of three different refactorings for the Eiffel programming language, and by applying the resulting refactoring tools to several sample programs. Outcome suggests that our approach is indeed viable. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Steimann, F., Kollee, C., & Von Pilgrim, J. (2011). A refactoring constraint language and its application to eiffel. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6813 LNCS, pp. 255–280). https://doi.org/10.1007/978-3-642-22655-7_13

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