Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10329721 | Electronic Notes in Theoretical Computer Science | 2005 | 16 Pages |
Abstract
Refactorings are program transformations that improve the software structure while preserving the external behaviour. In spite of this very useful property, refactorings can still give rise to structural conflicts when parallel evolutions to the same software are made by different developers. This paper explores this problem of structural evolution conflicts in a formal way by using graph transformation and critical pair analysis. Based on experiments carried out in the graph transformation tool AGG, we show how this formalism can be exploited to detect and resolve refactoring conflicts.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Tom Mens, Gabriele Taentzer, Olga Runge,