A Graphical Approach to Prove the Semantic Preservation of UML / OCL Refactoring Rules
Abstract
Refactoring is a powerful technique to improve the quality of software models including implementation code. The software developer applies successively so-called refactoring rules on the current software model and transforms it into a new model. Ideally, the application of a refactoring rule preserves the semantics of the model, on which it is applied. In this paper, we present a simple criterion and a proof technique for the semantic preservation of refactoring rules that are defined for UML class diagrams and OCL constraints. Our approach is based on a novel formalization of the OCL semantics in form of graph transformation rules. We illustrate our approach using the refactoring rule MoveAttribute.
A Graphical Approach to Prove the Semantic Preservation of UML / OCL Refactoring Rules
Preservation of UML/OCL Refactoring Rules
Thomas Baar and Slaviˇsa Markovic´
Technical Report No. LGL-REPORT-2006-001
February 2006
Software Engineering Laboratory
School of Computer and Communication Sciences
Ecole Polytechnique Fe´de´rale de Lausanne (EPFL)
CH-1015 Lausanne, Switzerland
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime