This printer-friendly version omits the website menu. Switch back

FOTS / Publications


TitleExtending Graph Rewriting for Refactoring
Author(s)Niels Van Eetvelde and Dirk Janssens
Download N/A
AbstractRefactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising approach towards the problem of program erosion. Nevertheless a solid theoretical foundation is still lacking. In this paper we focus on improving the expressive power of graph rewriting rules, so that more refactorings can be expressed by single rules. Two new mechanisms are introduced: a notion of refinement of graphs, enabling one to treat specific substructures (e.g. syntax trees of expressions) as a whole, and a notion of duplication, enabling one to use parts of rewriting rules as prototypes that can be instantiated several times. Both mechanisms can be viewed as ways to specify large or infinite sets of rules in a concise way. It is shown that the refactorings PushdownMethod
	author = {Niels Van Eetvelde and Dirk Janssens},
	title = {Extending Graph Rewriting for Refactoring},
	booktitle = {Proceedings of International Conference of Graph 
Transformation 2004},
	month = {September},
	publisher = {Springer 
	year = {2004},
	note = {}

FoTS - Universiteit Antwerpen - 2009-2011

for the footer