DI-UMONS : Dépôt institutionnel de l’université de Mons

Recherche transversale
Rechercher
(titres de publication, de périodique et noms de colloque inclus)
2005-07-01 - Article/Dans un journal avec peer-review - Anglais - 30 page(s)

Mens Tom , Van Eetvelde Niels, Demeyer Serge, Janssens Dirk, "Formalizing refactorings with graph transformations" in Journal of Software Maintenance & Evolution : Research & Practice, 17, 4, 247-276

  • Edition : John Wiley & Sons, Inc. - Engineering
  • Codes CREF : Informatique appliquée logiciel (DI2570), Informatique mathématique (DI1160)
  • Unités de recherche UMONS : Génie Logiciel (S852)
Texte intégral :

Abstract(s) :

(Anglais) 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.

Identifiants :
  • DOI : 10.1002/smr.v17:4
  • ISSN : 1532-060X