Iterative Development of Consistency-Preserving Rule-Based Refactorings (bibtex)
by , , , ,
Abstract:
A model refactoring does not only need to ensure behavior preservation. First of all, it needs to ensure that specific well-formedness constraints of the modeling language under consideration are preserved (consistency preservation). The consistency of model refactorings can be ensured by runtime checks. However, this means that not the developer of the refactorings but the user is confronted with the problem. In this paper we present an approach to statically check for consistency preservation of rule-based refactorings at design time. Thereby, refactoring rules describe which side-effects may take place on the model to be refactored. We formalize rule-based refactorings using graph transformation and consistency using graph constraints. We extend a verification technique capable of proving statically that refactoring rule applications preserve consistency. By automatically computing meaningful counterexamples, this technique allows for the iterative development of refactoring rules guaranteeing consistency preservation. We demonstrate the approach for common Java refactorings applied to a fine grained EMF model and can show that bugs that were present in refactorings of former Eclipse versions could have been avoided using our approach.
Reference:
Iterative Development of Consistency-Preserving Rule-Based Refactorings (Basil Becker, Leen Lambers, Johannes Dyck, Stefanie Birth, Holger Giese), In Theory and Practice of Model Transformations, Fourth International Conference, ICMT 2011, Zurich, Switzerland, June 27-28, 2011. Proceedings (Jordi Cabot, Eelco Visser, eds.), Springer / Heidelberg, volume 6707, 2011.
Bibtex Entry:
@InProceedings{BeckerLDBG2011,
AUTHOR = {Becker, Basil and Lambers, Leen and Dyck, Johannes and Birth, Stefanie and Giese, Holger},
TITLE = {{Iterative Development of Consistency-Preserving Rule-Based Refactorings}},
YEAR = {2011},
BOOKTITLE = {Theory and Practice of Model Transformations, Fourth International Conference, ICMT 2011, Zurich, Switzerland, June 27-28, 2011. Proceedings},
VOLUME = {6707},
PAGES = {123-137},
EDITOR = {Cabot, Jordi and Visser, Eelco},
SERIES = {Lecture Notes in Computer Science},
PUBLISHER = {Springer / Heidelberg},
URL = {http://www.springerlink.com/content/2u81033704112875/},
ABSTRACT = {

A model refactoring does not only need to ensure behavior preservation. First of all, it needs to ensure that specific well-formedness constraints of the modeling language under consideration are preserved (consistency preservation). The consistency of model refactorings can be ensured by runtime checks. However, this means that not the developer of the refactorings but the user is confronted with the problem.

In this paper we present an approach to statically check for consistency preservation of rule-based refactorings at design time. Thereby, refactoring rules describe which side-effects may take place on the model to be refactored. We formalize rule-based refactorings using graph transformation and consistency using graph constraints. We extend a verification technique capable of proving statically that refactoring rule applications preserve consistency. By automatically computing meaningful counterexamples, this technique allows for the iterative development of refactoring rules guaranteeing consistency preservation. We demonstrate the approach for common Java refactorings applied to a fine grained EMF model and can show that bugs that were present in refactorings of former Eclipse versions could have been avoided using our approach.
}
}
Powered by bibtexbrowser