The GP Programming System

2015/11/03 by Greg Manning, Manning, Greg, Detlef Plump +1 · 2 citations
Computer Science · #Logic, programming, and type systems #Model-Driven Software Engineering Techniques #Semantic Web and Ontologies

paper · doi:10.14279/tuj.eceasst.10.150

openalex publication_date 2024/04/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/01

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.

Citations

• Generic Search Plans for Matching Advanced Graph Patterns

Cited by

• De-/Re-constructing Model Transformation Languages
• Efficient Graph Rewriting
• Minimizing Finite Automata with Graph Programs

Related

• Improving the GP 2 Compiler
• Fast Rule-Based Graph Programs
• The Jury is still out: A Comparison of AGG, Fujaba, and PROGRES
• The Graph Rewriting and Transformation Language: GReAT
• The Improved GP 2 Compiler