Triple Graph Grammars (TGGs) are a bidirectional model transformation language, which has been successfully used in different application scenarios over the years. Our solution for the FIXML case study of the Transformation Tool Contest (TTC 2014) is imple-mented using TGGs and eMoflon (www.emoflon.org), a meta-modelling and model transformation tool developed at the Real-Time Systems Lab of TU Darmstadt. The solution, available as a virtual machine hosted on Share [5], includes the following: (i) an XML parser to a generic tree model called MocaTree (already a built-in feature of eMoflon), (ii) a target meta-model specification, (iii) TGG rules describing a bidirectional transformation between MocaTree and the target meta-model, and (iv) a...
In modern, computer-aided engineering processes, restoring and maintaining the consistency of multip...
Typical techniques of model-driven development use graph transformations to manipulate models and us...
Triple graph grammars (TGGs) provide a declarative, rule-based means of specifying binary consistenc...
Triple graph grammars (TGGs) provide a formal framework for bidirectional model transformations. As ...
After 20 years of Triple Graph Grammars (TGGs) and numerous actively maintained implementa-tions, th...
Triple graph grammars (TGGs) provide a formal framework for bidirectional model transformations. As ...
Our solution to the Java Refactoring case study of the Transformation Tool Contest (TTC 2015) is imp...
Abstract: Model transformation plays a central role in Model-Driven Engineer-ing (MDE) and supportin...
Model transformation plays a central role in Model-Driven Engineering (MDE) and supporting bidirecti...
Copyright c © 2014 for the individual papers by the papers ’ authors. Copying permitted only for pri...
Along with the AGTIVE 2007 conference, a Graph Transformation Tools Contest invited tool implementer...
Triple graph grammars (TGGs) provide a declarative, rule-based means of specifying binary consistenc...
SIGMA is a family of Scala internal Domain-Specific Languages (DSLs) for model manipu-lation that pr...
Engineering processes are often inherently concurrent, involving multiple stakeholders working in pa...
Software systems become more and more complex. Despite significant advances in code-centric technolo...
In modern, computer-aided engineering processes, restoring and maintaining the consistency of multip...
Typical techniques of model-driven development use graph transformations to manipulate models and us...
Triple graph grammars (TGGs) provide a declarative, rule-based means of specifying binary consistenc...
Triple graph grammars (TGGs) provide a formal framework for bidirectional model transformations. As ...
After 20 years of Triple Graph Grammars (TGGs) and numerous actively maintained implementa-tions, th...
Triple graph grammars (TGGs) provide a formal framework for bidirectional model transformations. As ...
Our solution to the Java Refactoring case study of the Transformation Tool Contest (TTC 2015) is imp...
Abstract: Model transformation plays a central role in Model-Driven Engineer-ing (MDE) and supportin...
Model transformation plays a central role in Model-Driven Engineering (MDE) and supporting bidirecti...
Copyright c © 2014 for the individual papers by the papers ’ authors. Copying permitted only for pri...
Along with the AGTIVE 2007 conference, a Graph Transformation Tools Contest invited tool implementer...
Triple graph grammars (TGGs) provide a declarative, rule-based means of specifying binary consistenc...
SIGMA is a family of Scala internal Domain-Specific Languages (DSLs) for model manipu-lation that pr...
Engineering processes are often inherently concurrent, involving multiple stakeholders working in pa...
Software systems become more and more complex. Despite significant advances in code-centric technolo...
In modern, computer-aided engineering processes, restoring and maintaining the consistency of multip...
Typical techniques of model-driven development use graph transformations to manipulate models and us...
Triple graph grammars (TGGs) provide a declarative, rule-based means of specifying binary consistenc...