Graph-based approach for detecting impure refactoring from version commits
説明
Impure refactoring is defined as a refactoring operation that was saved together with non-refactoring changes or several refactoring operations were saved at the same location stored in source code repositories. Many of existing approaches are not correctly viable for detecting impure refactoring. To mitigate this problem, we propose an approach that detects impure refactoring from commits stored in the repositories using a graph search algorithm. In case study, we applied our approach to two actual classes in Apache Xerces project and confirmed the feasibility of the approach.
収録刊行物
-
- Proceedings of the 1st International Workshop on Software Refactoring
-
Proceedings of the 1st International Workshop on Software Refactoring 13-16, 2016-09-04
ACM