The Design of GP 2

Abstract

This papers defines the syntax and semantics of GP 2, a revised version of the graph programming language GP. New concepts are illustrated and explained with example programs. Changes to the first version of GP include an improved type system for labels, a built-in marking mechanism for nodes and edges, a more powerful edge predicate for conditional rule schemata, and functions returning the indegree and outdegree of matched nodes. Moreover, the semantics of the branching and loop statement have been simplified to allow their efficient implementation.

In Proceedings WRS 2011, arXiv:1204.5318

References in corpus (1)

• The Semantics of Graph Programs

Cited by in corpus (16)

• Verifying Monadic Second-Order Properties of Graph Programs
• Reasoning about Graph Programs
• Evolving Graphs with Semantic Neutral Drift
• Verifying Graph Programs with First-Order Logic
• Incorrectness Logic for Graph Programs
• A Reference Interpreter for the Graph Programming Language GP 2
• Ideograph: A Language for Expressing and Manipulating Structured Data
• A Semantics Comparison Workbench for a Concurrent, Asynchronous, Distributed Programming Language
• A Small-Step Operational Semantics for GP 2
• Introducing Quantification into a Hierarchical Graph Rewriting Language
• Verifying Graph Programs with First-Order Logic (Extended Version)
• A Fast Graph Program for Computing Minimum Spanning Trees
• Linear-Time Graph Programs without Preconditions
• Time and Space Measures for a Complete Graph Computation Model
• A Foundation for Functional Graph Programs: The Graph Transformation Control Algebra (GTA)
• A Unification Algorithm for GP 2 (Long Version)