Analysing refactoring dependencies using graph transformation Export

@article{citeulike:1123243, abstract = {Refactoring is a widely accepted technique to improve the structure of object-oriented software. Nevertheless, existing tool support remains restricted to automatically applying refactoring transformations. Deciding what to refactor and which refactoring to apply still remains a difficult manual process, due to the many dependencies and interrelationships between relevant refactorings. In this paper, we represent refactorings as graph transformations, and we propose the technique of critical pair analysis to detect the implicit dependencies between refactorings. The results of this analysis can help the developer to make an informed decision of which refactoring is most suitable in a given context and why. We report on several experiments we carried out in the AGG graph transformation tool to support our claims.}, author = {Mens, Tom and Taentzer, Gabriele and Runge, Olga}, citeulike-article-id = {1123243}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/s10270-006-0044-6}, citeulike-linkout-1 = {http://www.springerlink.com/content/j67r221256566250}, citeulike-linkout-2 = {http://dx.doi.org/10.1007/s10270-006-0044-6}, citeulike-linkout-3 = {http://dx.doi.org/http://dx.doi.org/10.1007/s10270-006-0044-6}, day = {15}, doi = {10.1007/s10270-006-0044-6}, journal = {Software and Systems Modeling}, keywords = {agg, analysis, dependence, graph, r1, refactoring, transformation}, month = {September}, number = {3}, pages = {269--285}, posted-at = {2008-10-21 10:55:16}, priority = {5}, publisher = {Springer Berlin / Heidelberg}, title = {Analysing refactoring dependencies using graph transformation}, url = {http://dx.doi.org/10.1007/s10270-006-0044-6}, volume = {6}, year = {2007} }

TY - JOUR ID - citeulike:1123243 L3 - citeulike-article-id:1123243 N2 - Refactoring is a widely accepted technique to improve the structure of object-oriented software. Nevertheless, existing tool support remains restricted to automatically applying refactoring transformations. Deciding what to refactor and which refactoring to apply still remains a difficult manual process, due to the many dependencies and interrelationships between relevant refactorings. In this paper, we represent refactorings as graph transformations, and we propose the technique of critical pair analysis to detect the implicit dependencies between refactorings. The results of this analysis can help the developer to make an informed decision of which refactoring is most suitable in a given context and why. We report on several experiments we carried out in the AGG graph transformation tool to support our claims. IS - 3 JF - Software and Systems Modeling EP - 285 TI - Analysing refactoring dependencies using graph transformation PB - Springer Berlin / Heidelberg VL - 6 SP - 269 KW - agg KW - analysis KW - dependence KW - graph KW - r1 KW - refactoring KW - transformation AU - Mens, Tom AU - Taentzer, Gabriele AU - Runge, Olga PY - 2007/September/15/ UR - http://dx.doi.org/10.1007/s10270-006-0044-6 ER -