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
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.
Type de document :
Communication dans un congrès
LOPSTR 2011 - 21st International Symposium on Logic-Based Program Synthesis and Transformation, Jul 2011, Odense, Denmark. Springer, 2012, LNCS
Liste complète des métadonnées

Littérature citée [41 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-00684244
Contributeur : Helene Kirchner <>
Soumis le : samedi 31 mars 2012 - 11:03:39
Dernière modification le : jeudi 19 avril 2018 - 14:24:03
Document(s) archivé(s) le : mercredi 14 décembre 2016 - 19:44:31

Fichier

maincameraready.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00684244, version 1

Collections

INRIA

Citation

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. Springer, 2012, LNCS. 〈hal-00684244〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

125

Téléchargements de fichiers

156

Contact


archive-ouverte@inria.fr