Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories
From MaRDI portal
Publication:3416072
Recommendations
Cited in
(19)- High-Level Programs and Program Conditions
- Translating essential OCL invariants to nested graph constraints focusing on set operations
- A Unified Categorical Approach for Attributed Graph Rewriting
- The PBPO graph transformation approach
- Symbolic graphs for attributed graph constraints
- Algebraic properties and transformations of monographs
- Verification of graph grammars using a logical approach
- Attributed graph transformation with node type inheritance
- Graph Transformations
- From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
- Variability-based model transformation: formal foundation and application
- Explicit State Model Checking for Graph Grammars
- The Edge of Graph Transformation — Graphs for Behavioural Specification
- Graph transformations for object-oriented refinement
- A general attribution concept for models in \({\mathcal M}\)-adhesive transformation systems
- A graph-based generic type system for object-oriented programs
- Modeling dynamic reconfigurations in Reo using high-level replacement systems
- Theorem proving graph grammars with attributes and negative application conditions
- Multilevel typed graph transformations
This page was built for publication: Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416072)