Programmed graph transformations and graph transformation units in GRACE

DOI10.1007/3-540-61228-9_83MaRDI QIDQ4645271zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

denotational semanticsgraph transformationgraph grammarsemantic domainrule priority

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1629840
• On the interleaving semantics of transformation units -- a step into GRACE
• Undecidable control conditions in graph transformation units
• Graph transformation for specification and programming
• scientific article; zbMATH DE number 1629837

Cites work

• scientific article; zbMATH DE number 3819112 (Why is no real title available?)
• scientific article; zbMATH DE number 177458 (Why is no real title available?)
• scientific article; zbMATH DE number 194024 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3630234 (Why is no real title available?)
• scientific article; zbMATH DE number 219232 (Why is no real title available?)
• Efficient graph rewriting and its implementation
• Graph transformation units with interleaving semantics
• Guarded commands, nondeterminacy and formal derivation of programs

Cited in

(8)

• scientific article; zbMATH DE number 219232 (Why is no real title available?)
• Structured modeling with GRACE
• Parameterized transformation units
• scientific article; zbMATH DE number 1629840 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• PROGRES

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)