Programmed graph transformations and graph transformation units in GRACE
From MaRDI portal
Publication:4645271
DOI10.1007/3-540-61228-9_83zbMATH Open1412.68118OpenAlexW1577379544MaRDI QIDQ4645271FDOQ4645271
Authors: Andy Schürr 
Publication date: 10 January 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61228-9_83
Recommendations
Cites Work
- Title not available (Why is that?)
- Guarded commands, nondeterminacy and formal derivation of programs
- Graph transformation units with interleaving semantics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient graph rewriting and its implementation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Structured modeling with GRACE
- Parameterized transformation units
- Title not available (Why is that?)
- GRACE as a unifying approach to graph-transformation-based specification1 1This work was partially supported by the ESPRIT Working Group Applications of Graph Transformation (APPLIGRAPH) and the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems).
- A foundation for functional graph programs: the \textit{graph transformation control algebra} (GTA)
- From imperative to rule-based graph programs
- Undecidable control conditions in graph transformation units
Uses Software
This page was built for publication: Programmed graph transformations and graph transformation units in GRACE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645271)
