<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tom Mens</style></author><author><style face="normal" font="default" size="100%">Niels Van Eetvelde</style></author><author><style face="normal" font="default" size="100%">Serge Demeyer</style></author><author><style face="normal" font="default" size="100%">Dirk Janssens</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Formalizing Refactorings with Graph Transformations</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal on Software Maintenance: Research and Practice</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">jul</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">4</style></number><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons</style></publisher><volume><style face="normal" font="default" size="100%">15</style></volume><pages><style face="normal" font="default" size="100%">247-276</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract><notes><style face="normal" font="default" size="100%">[SCI impact factor 0.457, ranked 60 / 79]</style></notes></record></records></xml>