The GP Programming System

Abstract: We describe the programming system for the graph-transformation lan, 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.

• Type: Journal
• Year: 2008
• Where: ECEASST
• Authors: Greg Manning, Detlef Plump
• Keywords: Conditional Rule Schemata, ECEASST 2008, Input Graphs, Simple Formal Semantics