Abstract
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 proper ties. In this paper we explore the use of graph rewriting for specifying refactorings and their effe ct on programs. We introduce a graph rep- resentation 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 f ormalism for such proofs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Software Maintenance and Evolution: Research and Practice
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
