| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
A Strategy Language for Graph Rewriting
Abstract : 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.
Cited literature [41 references]
https://hal.inria.fr/hal-00684244
Contributor : Helene Kirchner <>
Submitted on : Saturday, March 31, 2012 - 11:03:39 AM
Last modification on : Thursday, March 5, 2020 - 4:49:06 PM
Long-term archiving on: : Wednesday, December 14, 2016 - 7:44:31 PM
Contributor : Helene Kirchner <>
Submitted on : Saturday, March 31, 2012 - 11:03:39 AM
Last modification on : Thursday, March 5, 2020 - 4:49:06 PM
Long-term archiving on: : Wednesday, December 14, 2016 - 7:44:31 PM
File
maincameraready.pdf
Files produced by the author(s)