Refactoring OCL annotated UML class diagrams

Refactoring of UML class diagrams is an emerging research topic and heavily inspired by refactoring of program code written in object-oriented implementation languages. Current class diagram refactoring techniques concentrate on the diagrammatic part but neglect OCL constraints that might become syn...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Software and systems modeling Ročník 7; číslo 1; s. 25 - 47
Hlavní autoři: Marković, Slaviša, Baar, Thomas
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer-Verlag 01.02.2008
Témata:
Compilers
Computer Science
Information Systems Applications (incl.Internet)
Interpreters
IT in Business
Programming Languages
Programming Techniques
Regular Paper
Software Engineering
Software Engineering/Programming and Operating Systems
Graph-transformations
Syntax preserving refactoring rules
Imperative OCL
Source code verification
Refactoring
QVT
ISSN:1619-1366, 1619-1374
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Refactoring of UML class diagrams is an emerging research topic and heavily inspired by refactoring of program code written in object-oriented implementation languages. Current class diagram refactoring techniques concentrate on the diagrammatic part but neglect OCL constraints that might become syntactically incorrect by changing the underlying class diagram. This paper formalizes the most important refactoring rules for class diagrams and classifies them with respect to their impact on attached OCL constraints. For refactoring rules that have an impact on OCL constraints, we formalize the necessary changes of the attached constraints. Our refactoring rules are specified in a graph-grammar inspired formalism. They have been implemented as QVT transformation rules. We finally discuss for our refactoring rules the problem of syntax preservation and show, by using the KeY-system, how this can be resolved.
ISSN:1619-1366
1619-1374
DOI:10.1007/s10270-007-0056-x