Specification of graph translators with triple graph grammars
From MaRDI portal
Publication:6184366
DOI10.1007/3-540-59071-4_45zbMATH Open1528.68166OpenAlexW1511832825MaRDI QIDQ6184366FDOQ6184366
Authors: Andy Schürr
Publication date: 5 January 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59071-4_45
Recommendations
- Non-materialized Model View Specification with Triple Graph Grammars
- Construction of integrity preserving triple graph grammars
- Extended triple graph grammars with efficient and compatible graph translators
- Toward bridging the gap between formal foundations and current practice for triple graph grammars. Flexible relations between source and target elements
- 15 Years of Triple Graph Grammars
Data structures (68P05) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
Cited In (9)
- Title not available (Why is that?)
- Termination and expressiveness of execution strategies for networks of bidirectional model transformations
- Title not available (Why is that?)
- 15 Years of Triple Graph Grammars
- Single pushout rewriting in comprehensive systems
- Advanced model consistency restoration with higher-order short-cut rules
- Advanced consistency restoration with higher-order short-cut rules
- Translating controlled graph grammars to ordinary graph grammars
- Constructing constraint-preserving interaction schemes in adhesive categories
This page was built for publication: Specification of graph translators with triple graph grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184366)