The GP Programming System

Greg Manning; Detlef Plump

doi:10.14279/tuj.eceasst.10.150

The GP Programming System

Greg Manning, Detlef Plump

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We describe the programming system for the graph-transformation language
GP, focusing on the implementation of its compiler and abstract machine. We
also compare the system’s performance with other graph-transformation systems.
The GP language is based on conditional rule schemata and comes with a simple
formal semantics which maps input graphs to sets of output graphs. The implementation faithfully matches the semantics by using backtracking and allowing to compute all possible results for a given input.

Original language	English
Title of host publication	Proceedings of the Seventh International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2008)
Pages	1-13
DOIs	https://doi.org/10.14279/tuj.eceasst.10.150
Publication status	Published - 2008

Publication series

Name	Electronic Communications of the EASST
Volume	10

Access to Document

10.14279/tuj.eceasst.10.150

Cite this

@inproceedings{e55523186d834da7a2af059bffc2afc2,

title = "The GP Programming System",

abstract = "We describe the programming system for the graph-transformation languageGP, focusing on the implementation of its compiler and abstract machine. Wealso compare the system{\textquoteright}s performance with other graph-transformation systems.The GP language is based on conditional rule schemata and comes with a simpleformal semantics which maps input graphs to sets of output graphs. The implementation faithfully matches the semantics by using backtracking and allowing to compute all possible results for a given input.",

author = "Greg Manning and Detlef Plump",

year = "2008",

doi = "10.14279/tuj.eceasst.10.150",

language = "English",

series = "Electronic Communications of the EASST",

pages = "1--13",

booktitle = "Proceedings of the Seventh International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2008)",

}

TY - GEN

T1 - The GP Programming System

AU - Manning, Greg

AU - Plump, Detlef

PY - 2008

Y1 - 2008

N2 - We describe the programming system for the graph-transformation languageGP, focusing on the implementation of its compiler and abstract machine. Wealso compare the system’s performance with other graph-transformation systems.The GP language is based on conditional rule schemata and comes with a simpleformal semantics which maps input graphs to sets of output graphs. The implementation faithfully matches the semantics by using backtracking and allowing to compute all possible results for a given input.

AB - We describe the programming system for the graph-transformation languageGP, focusing on the implementation of its compiler and abstract machine. Wealso compare the system’s performance with other graph-transformation systems.The GP language is based on conditional rule schemata and comes with a simpleformal semantics which maps input graphs to sets of output graphs. The implementation faithfully matches the semantics by using backtracking and allowing to compute all possible results for a given input.

U2 - 10.14279/tuj.eceasst.10.150

DO - 10.14279/tuj.eceasst.10.150

M3 - Conference contribution

T3 - Electronic Communications of the EASST

SP - 1

EP - 13

BT - Proceedings of the Seventh International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2008)

ER -