School of Computing

Constructs for Programming with Graph Rewrites

Peter Rodgers

In H Ehrig and G Taentzer, editors, GRATRA 2000: Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems, pages 182-196, March 2000.

Abstract

Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce the size of programs, improve the efficiency of execution and simplify the host graph undergoing rewriting.

Download publication 551 kbytes (PostScript)

Bibtex Record

@inproceedings{1027,
author = {Peter Rodgers},
title = {{Constructs for Programming with Graph Rewrites}},
month = {March},
year = {2000},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2000/1027},
    ISSN = {1436-9915},
    booktitle = {GRATRA 2000: Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems},
    editor = {H Ehrig and G Taentzer},
    publication_type = {inproceedings},
    refereed = {Yes},
    submission_id = {22892_955024216},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014