Journal
JOURNAL OF SOFTWARE MAINTENANCE AND EVOLUTION-RESEARCH AND PRACTICE
Volume 17, Issue 4, Pages 247-276Publisher
WILEY
DOI: 10.1002/smr.316
Keywords
refactoring; formal specification; graph transformation; behaviour preservation
Categories
Ask authors/readers for more resources
The widespread interest in refactoring-transforming the source-code of an object-oriented program without changing its external behaviour-has increased the need for a precise definition of refactoring transformations and their properties. In this paper we explore the use of graph rewriting for specifying refactorings and their effect on programs. We introduce a graph representation for programs and show how two representative refactorings can be expressed by graph productions. Then we demonstrate that it is possible to prove that refactorings preserve certain program properties, and that graph rewriting is a suitable formalism for such proofs. Copyright (c) 2005 John Wiley & Sons, Ltd.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available