Formalizing refactorings with graph transformations Export

@article{citeulike:306412, 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 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 \© 2005 John Wiley \& Sons, Ltd.}, author = {Mens, Tom and Van Eetvelde, Niels and Demeyer, Serge and Janssens, Dirk}, citeulike-article-id = {306412}, citeulike-linkout-0 = {http://dx.doi.org/10.1002/smr.316}, citeulike-linkout-1 = {http://www3.interscience.wiley.com/cgi-bin/abstract/110572526/ABSTRACT}, day = {27}, doi = {10.1002/smr.316}, issn = {1532-0618}, journal = {Journal of Software Maintenance and Evolution: Research and Practice}, keywords = {formalism, refactoring}, month = {July}, number = {4}, pages = {247--276}, posted-at = {2009-10-24 02:17:16}, priority = {2}, title = {Formalizing refactorings with graph transformations}, url = {http://dx.doi.org/10.1002/smr.316}, volume = {17}, year = {2005} }

TY - JOUR ID - citeulike:306412 L3 - citeulike-article-id:306412 N2 - 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 © 2005 John Wiley & Sons, Ltd. IS - 4 JF - Journal of Software Maintenance and Evolution: Research and Practice SN - 1532-0618 EP - 276 TI - Formalizing refactorings with graph transformations VL - 17 SP - 247 KW - formalism KW - refactoring AU - Mens, Tom AU - Van Eetvelde, Niels AU - Demeyer, Serge AU - Janssens, Dirk PY - 2005/07/27/ UR - http://dx.doi.org/10.1002/smr.316 ER -