Specification of Graph Translators with Triple Graph Grammars
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
15 Years of Triple Graph Grammars
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
On Integrating OCL and Triple Graph Grammars
Models in Software Engineering
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Information preserving bidirectional model transformations
FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
Proceedings of the First International Workshop on Model-Driven Interoperability
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
Ensuring structural constraints in graph-based models with type inheritance
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Theory of Constraints and Application Conditions: From Graphs to High-Level Structures
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
| Hi-index | 0.00 |
Triple Graph Grammars (TGGs) are a rule-based technique of specifying a consistency relation over a source, correspondence, and target domain, which can be used for bidirectional model transformation. A current research challenge is increasing the expressiveness of TGGs by ensuring that global constraints in the involved domains are not violated by the transformation. Negative Application Conditions (NACs) can be used to enforce this property, referred to as schema compliance. In previous work, we have presented a polynomial control algorithm for integrity preserving TGGs, using NACs only to ensure schema compliance, meaning that, for efficiency reasons, the usage of NACs must be restricted appropriately. In this paper, we apply the well-known translation of global constraints to application conditions for a given TGG and set of global constraints. We show that the derived set of NACs is indeed sufficient and necessary to ensure schema compliance, i.e., that the TGG together with the derived NACs is integrity preserving by construction.