Reference : Towards Domain Completeness for Model Transformations Based on Triple Graph Grammars
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/19895
Towards Domain Completeness for Model Transformations Based on Triple Graph Grammars
English
Nachtigall, Nico mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Hermann, Frank mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Braatz, Benjamin mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Engel, Thomas mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2014
Proceedings of the Third International Workshop on Verification of Model Transformations - co-located with Software Technologies: Applications and Foundations (STAF 2014)
Amrani, Moussa
Syriani, Eugene
Wimmer, Manuel
CEUR-WS.org
CEUR Workshop Proceedings, Vol-1325
46-55
Yes
International
3rd International Workshop on Verification of Model Transformations 2014 (VOLT'14)
21-07-2014
Moussa Amrani, Eugene Syriani, Manuel Wimmer
York
United Kingdom
[en] model transformation ; completeness ; graph grammars ; constraints
[en] The analysis of model transformations is a challenging research area within model driven engineering. Triple graph grammars (TGGs) have been applied in various transformation scenarios and their formal foundation has been a vital ground for general results concerning
notions of correctness and completeness.
This paper addresses existing gaps between practical scenarios and the formal results of TGGs concerning the notion of completeness. Since the source domain language of a model transformation is usually specified independently from the TGG, we use the notion of domain completeness, which requires that the model transformation has to provide a corresponding
target model for each model of the source domain language. As main result, we provide a general method for showing that the source domain language is included in the language that is generated by the source rules of the TGG. This provides the first of two components for
verifying domain completeness. The running example is the well studied object-relational mapping.
Researchers ; Professionals
http://hdl.handle.net/10993/19895
http://ceur-ws.org/Vol-1325/

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
paper6(1).pdfPublisher postprint516.8 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.