zbMATH — the first resource for mathematics

A strategy language for graph rewriting. (English) Zbl 1377.68098
Vidal, Germán (ed.), Logic-based program synthesis and transformation. 21st international symposium, LOPSTR 2011. Odense, Denmark, July 18–20, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32210-5/pbk). Lecture Notes in Computer Science 7225, 173-188 (2012).
Summary: We give a formal semantics for a graph-based programming language, where a program consists of a collection of graph rewriting rules, a user-defined strategy to control the application of rules, and an initial graph to be rewritten. The traditional operators found in strategy languages for term rewriting have been adapted to deal with the more general setting of graph rewriting, and some new constructs have been included in the language to deal with graph traversal and management of rewriting positions in the graph. This language is part of the graph transformation and visualisation environment PORGY.
For the entire collection see [Zbl 1253.68022].

68Q42 Grammars and rewriting systems
PDF BibTeX Cite
Full Text: DOI