Programmed graph transformations and graph transformation units in GRACE

DOI10.1007/3-540-61228-9_83zbMath1412.68118OpenAlexW1577379544MaRDI QIDQ4645271

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

zbMATH Keywords

denotational semanticsgraph grammargraph transformationsemantic domainrule priority

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (3)

Structured Modeling with GRACE ⋮ Parameterized Transformation Units ⋮ 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).

Uses Software

• Unnamed Item

Cites Work

• Graph transformation units with interleaving semantics
• Efficient graph rewriting and its implementation
• Guarded commands, nondeterminacy and formal derivation of programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Programmed graph transformations and graph transformation units in GRACE