Specifying integrated refactoring with distributed graph transformations

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

Abstract

With refactoring, the internal structure of a software system changes to support subsequent reuse and maintenance, while preserving the system behavior. To maintain consistency between the code (represented as a flow graph) and the model (given by several UML diagrams of different kinds), we propose a framework based on distributed graphs. Each refactoring is specified as a set of distributed graph transformations, structured and organized into transformation units. This formalism could be used as the basis for important extensions to current refactoring tools. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Bottoni, P., Presicce, F. P., & Taentzer, G. (2004). Specifying integrated refactoring with distributed graph transformations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3062, 220–235. https://doi.org/10.1007/978-3-540-25959-6_16

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