Reference : Towards Domain Completeness for Model Transformations Based on Triple Graph Grammars

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/19895

Title :	Towards Domain Completeness for Model Transformations Based on Triple Graph Grammars
Language :	English
Author, co-author :	Nachtigall, Nico [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Hermann, Frank [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Braatz, Benjamin [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Engel, Thomas [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	2014
Main document title :	Proceedings of the Third International Workshop on Verification of Model Transformations - co-located with Software Technologies: Applications and Foundations (STAF 2014)
Editor :	Amrani, Moussa
	Syriani, Eugene
	Wimmer, Manuel
Publisher :	CEUR-WS.org
Collection and collection volume :	CEUR Workshop Proceedings, Vol-1325
Pages :	46-55
Peer reviewed :	Yes
Audience :	International
Event name :	3rd International Workshop on Verification of Model Transformations 2014 (VOLT'14)
Event date :	21-07-2014
Event organizer :	Moussa Amrani, Eugene Syriani, Manuel Wimmer
Event place (city) :	York
Event country :	United Kingdom
Keywords :	[en] model transformation ; completeness ; graph grammars ; constraints
Abstract :	[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.
Target :	Researchers ; Professionals
Permalink :	http://hdl.handle.net/10993/19895
Other URL :	http://ceur-ws.org/Vol-1325/

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Limited access paper6(1).pdf Publisher postprint 516.8 kB Request a copy

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map