Authors: Mahua Banerjee, Dhanbad, Chiranjeev Kumar, Sushil Ranjan Roy and Ranchi
The refactoring process is facing several challenges including the identification of codes to be refactored. It has been found that through graphs and graph transformation rules one can find the refactoring sequences between two versions of the software system, which assures behavior preservation. In this paper, we present a model which applies graph transformation as a first step to determine the existence of a refactoring sequence. Depending upon the existence, the model suggests for execution of refactoring or termination of refactoring. We further propose a formal approach to refactor consistently in a model-driven manner.