Formal analysis of model transformations based on triple graph grammars

DOI10.1017/S0960129512000370MaRDI QIDQ5740377zbMATH OpenOpenAlexFDO

Authors Frank Hermann, Hartmut Ehrig, Ulrike Golas, Fernando Orejas

Publication date 26 July 2016

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129512000370

Mathematics Subject Classification ID

Database theory (68P15) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Formal analysis of functional behaviour for model transformations based on triple graph grammars
• Toward bridging the gap between formal foundations and current practice for triple graph grammars. Flexible relations between source and target elements
• Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
• A static analysis of non-confluent triple graph grammars for efficient model transformation
• Construction of integrity preserving triple graph grammars

Cites work

• Adhesive and quasiadhesive categories
• Correctness of high-level transformation systems relative to nested conditions
• Correctness, completeness and termination of pattern-based model-to-model transformation
• Formal analysis of functional behaviour for model transformations based on triple graph grammars
• Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
• Fundamentals of algebraic graph transformation
• Handbook of Graph Grammars and Computing by Graph Transformation
• Model View Management with Triple Graph Transformation Systems
• On theories with a combinatorial definition of 'equivalence'
• Pattern-Based Model-to-Model Transformation

Cited in

(17)

• Grammar-based model transformations: definition, execution, and quality properties
• Correctness, completeness and termination of pattern-based model-to-model transformation
• Toward bridging the gap between formal foundations and current practice for triple graph grammars. Flexible relations between source and target elements
• Towards automatic verification of behavior preservation for model transformation via invariant checking
• Construction of integrity preserving triple graph grammars
• Efficient model synchronization with precedence triple graph grammars
• Multi-amalgamated triple graph grammars
• Extended triple graph grammars with efficient and compatible graph translators
• A static analysis of non-confluent triple graph grammars for efficient model transformation
• Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
• Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
• Pattern-Based Model-to-Model Transformation
• Formal analysis of functional behaviour for model transformations based on triple graph grammars
• Incremental concurrent model synchronization using triple graph grammars
• Diagrammatic Representation and Inference
• Advanced consistency restoration with higher-order short-cut rules
• Advanced model consistency restoration with higher-order short-cut rules

This page was built for publication: Formal analysis of model transformations based on triple graph grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740377)