Universitätsverlag Potsdam

          Details zur ausgewählten Publikation


Automatic verification of behavior preservation at the transformation level for relational model transformation / Johannes Dyck, Holger Giese, Leen Lambers. - Potsdam: Universitätsverlag Potsdam, 2017. - VIII, 112 S. : graph. Darst.
(Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsdam ; 112)
1613-5652 (print)
2191-1665 (online)
ISBN 978-3-86956-391-6
Preis: kostenlos

Auf dem Publikationsserver der Universität unter:
http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-100279

Abstract:

The correctness of model transformations is a crucial element for model-driven engineering of high quality software. In particular, behavior preservation is the most important correctness property avoiding the introduction of semantic errors during the model-driven engineering process. Behavior preservation verification techniques either show that specific properties are preserved, or more generally and complex, they show some kind of behavioral equivalence or refinement between source and target model of the transformation. Both kinds of behavior preservation verification goals have been presented with automatic tool support for the instance level, i.e. for a given source and target model specified by the model transformation. However, up until now there is no automatic verification approach available at the transformation level, i.e. for all source and target models specified by the model transformation.



In this report, we extend our results presented in [27] and outline a new sophisticated approach for the automatic verification of behavior preservation captured by bisimulation resp. simulation for model transformations specified by triple graph grammars and semantic definitions given by graph transformation rules. In particular, we show that the behavior preservation problem can be reduced to invariant checking for graph transformation and that the resulting checking problem can be addressed by our own invariant checker even for a complex example where a sequence chart is transformed into communicating automata. We further discuss today's limitations of invariant checking for graph transformation and motivate further lines of future work in this direction.


redline            Universität Potsdam > Universitätsbibliothek > Universitätsverlag > Suche