The AGG approach: language and environment
Handbook of graph grammars and computing by graph transformation
Story Diagrams: A New Graph Rewrite Language Based on the Unified Modeling Language and Java
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Specification of Graph Translators with Triple Graph Grammars
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
Tool integration at the meta-model level: the Fujaba approach
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tool integration applications and frameworks
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Metamodel-based tool integration with moflon
Proceedings of the 30th international conference on Software engineering
Incremental model synchronization for multiple updates
Proceedings of the third international workshop on Graph and model transformations
On the relationship of model transformations based on triple and plain graph grammars
Proceedings of the third international workshop on Graph and model transformations
Embedding and Confluence of Graph Transformations with Negative Application Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
15 Years of Triple Graph Grammars
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Precise Semantics of EMF Model Transformations by Graph Transformation
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Correctness, completeness and termination of pattern-based model-to-model transformation
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Proceedings of the First International Workshop on Model-Driven Interoperability
Delaying constraint solving in symbolic graph transformation
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Formal analysis of functional behaviour for model transformations based on triple graph grammars
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Extended triple graph grammars with efficient and compatible graph translators
Graph transformations and model-driven engineering
Model synchronization at work: keeping SysML and AUTOSAR models consistent
Graph transformations and model-driven engineering
Toward Bridging the Gap between Formal Semantics and Implementation of Triple Graph Grammars
MODEVVA '10 Proceedings of the 2010 Workshop on Model-Driven Engineering, Verification, and Validation
Detecting and resolving model inconsistencies using transformation dependency analysis
MoDELS'06 Proceedings of the 9th international conference on Model Driven Engineering Languages and Systems
MoDELS'05 Proceedings of the 2005 international conference on Satellite Events at the MoDELS
Incremental model synchronization for efficient run-time monitoring
MODELS'09 Proceedings of the 2009 international conference on Models in Software Engineering
| Hi-index | 0.00 |
The correctness of model transformations is a crucial element for model-driven engineering of high-quality software. A prerequisite to verify model transformations at the level of the model transformation specification is that an unambiguous formal semantics exists and that the implementation of the model transformation language adheres to this semantics. However, for existing relational model transformation approaches, it is usually not really clear under which constraints particular implementations really conform to the formal semantics. In this paper, we will bridge this gap for the formal semantics of triple graph grammars (TGG) and an existing efficient implementation. While the formal semantics assumes backtracking and ignores non-determinism, practical implementations do not support backtracking, require rule sets that ensure determinism, and include further optimizations. Therefore, we capture how the considered TGG implementation realizes the transformation by means of operational rules, define required criteria, and show conformance to the formal semantics if these criteria are fulfilled. We further outline how static and runtime checks can be employed to guarantee these criteria.