A strategy language for graph rewriting

Authors:
Maribel Fernández;Hélène Kirchner;Olivier Namet
Affiliations:
Department of Informatics, King's College London, London, UK;Inria, Domaine de Voluceau - Rocquencourt, Le Chesnay, France;Department of Informatics, King's College London, London, UK
Venue:
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Year:
2011

Citing 22
Cited 1

Term graph rewriting

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Interaction nets

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach

Handbook of graph grammars and computing by graph transformation
Term graph rewriting

Handbook of graph grammars and computing by graph transformation
The AGG approach: language and environment

Handbook of graph grammars and computing by graph transformation
The FUJABA environment

Proceedings of the 22nd international conference on Software engineering
Selected writings on computing: a personal perspective

Selected writings on computing: a personal perspective
Functional Programming and Parallel Graph Rewriting

Functional Programming and Parallel Graph Rewriting
Computational Completeness of Programming Languages Based on Graph Transformation

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Stratego: A Language for Program Transformation Based on Rewriting Strategies

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Simulation of Turning Machines by a Left-Linear Rewrite Rule

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Double-pushout graph transformation revisited

Mathematical Structures in Computer Science
Stratego/XT 0.17. A language and toolset for program transformation

Science of Computer Programming
A Rewriting Calculus for Multigraphs with Ports

Electronic Notes in Theoretical Computer Science (ENTCS)
A Rewriting Semantics for Maude Strategies

Electronic Notes in Theoretical Computer Science (ENTCS)
A Higher-Order Graph Calculus for Autonomic Computing

Graph Theory, Computational Intelligence and Thought
The Graph Programming Language GP

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Towards a Strategy Language for Maude

Electronic Notes in Theoretical Computer Science (ENTCS)
A survey of strategies in rule-based program transformation systems

Journal of Symbolic Computation
Tom: piggybacking rewriting on java

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
GrGen: a fast SPO-based graph rewriting tool

ICGT'06 Proceedings of the Third international conference on Graph Transformations

PORGY: A Visual Graph Rewriting Environment for Complex Systems

Computer Graphics Forum

Quantified Score

Hi-index	0.00

Visualization

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.