A Strategy Language for Graph Rewriting

Helene Kirchner (1) , Olivier Namet (2) , Maribel Fernandez (2)

1 Inria Bordeaux - Sud-Ouest
2 DCS - Department of Computer Science

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.

Domaines: Logique en informatique [cs.LO]

Helene Kirchner, Olivier Namet, Maribel Fernandez. A Strategy Language for Graph Rewriting. LOPSTR 2011 - 21st International Symposium on Logic-Based Program Synthesis and Transformation, Jul 2011, Odense, Denmark. ⟨hal-00684244⟩