© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Pragmatic graph rewriting modifications
Peter J. Rodgers and Natalia Vidal
In Proceedings of the 1999 IEEE Symposium on Visual Languages, pages 182-196. IEEE Computer Society, September 1999.Abstract
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified as 'Single Match' are tested against the host graph one time only. This reduces the need for control flags to indicate the progress of execution of transformations.
Download publication 184 kbytes (PostScript)Bibtex Record
@inproceedings{896,
author = {Peter J. Rodgers and Natalia Vidal},
title = {Pragmatic Graph Rewriting Modifications},
month = {September},
year = {1999},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1999/896},
booktitle = {Proceedings of the 1999 IEEE Symposium on Visual Languages},
publisher = {IEEE Computer Society},
refereed = {Yes},
}