Paper Info
Title
Bidirectional model transformation with precedence triple graph grammars
Abstract
Triple Graph Grammars (TGGs) are a rule-based technique with a formal background for specifying bidirectional model transformation. In practical scenarios, the unidirectional rules needed for the forward and backward transformations are automatically derived from the TGG rules in the specification, and the overall transformation process is governed by a control algorithm. Current implementations either have a worst case exponential runtime complexity, based on the number of elements to be processed, or pose such strong restrictions on the class of supported TGGs that practical real-world applications become infeasible. This paper, therefore, introduces a new class of TGGs together with a control algorithm that drops a number of practice-relevant restrictions on TGG rules and still has a polynomial runtime complexity.
Year
DOI
Venue
2012
10.1007/978-3-642-31491-9_22
ECMFA
Keywords
Field
DocType
practical scenario,practical real-world application,bidirectional model transformation,tgg rule,overall transformation process,worst case exponential runtime,new class,polynomial runtime complexity,precedence triple graph grammar,triple graph grammars,control algorithm
Control algorithm,Model transformation,Programming language,Triple graph grammars,Exponential function,Polynomial,Computer science,Implementation,Theoretical computer science
Conference
Citations 
PageRank 
References 
11
0.61
13
Authors
4
Name
Order
Citations
PageRank
Marius Lauder11247.22
Anthony Anjorin219228.25
Gergely Varró340336.67
Andy Schürr42195230.25