The GP Programming System

  • 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 giWe 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.show moreshow less

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author: Greg Manning, Detlef Plump
URN:urn:nbn:de:kobv:83-opus-19987
ISBN:1863-2122
Series (Serial Number):Electronic Communications of the EASST- ECEASST (10/18)
Document Type:Wissenschaftlicher Artikel, Postprint
Language:English
Date of Publication (online):2008/08/28
Release Date:2008/08/28
Tag:GP; Graph Transformation; graph transformation; non-determinism; programming system
Source:http://eceasst.cs.tu-berlin.de/index.php/eceasst/issue/view/19
Institutes:Institut für Softwaretechnik und Theoretische Informatik
Dewey Decimal Classification:004 Datenverarbeitung; Informatik
Collection:Volume 10 (2008): Graph Transformation and Visual Modeling Techniques 2008
Licence (German):License Logo CC BY-NC-SA: Creative Commons-Lizenz: Namensnennung, nicht kommerziell, Weitergabe zu gleichen Bedingungen