Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

9-2012

Abstract

GP (for Graph Programs) is an experimental nondeterministic programming language which allows for the manipulation of graphs at a high level of abstraction. The program states of GP are directed labelled graphs. These are manipulated directly via the application of (conditional) rule schemata, which generalise double-pushout rules with expressions over labels and relabelling. In contrast with graph grammars, the application of these rule schemata is directed by a number of simple control constructs including sequential composition, conditionals, and as-long-as-possible iteration. GP shields programmers at all times from low-level implementation issues (e.g. graph representation), and with its nondeterministic semantics, allows one to solve graph-like problems in a declarative and natural way.

Keywords

Graph theory, graph transformations

Discipline

Theory and Algorithms

Research Areas

Software and Cyber-Physical Systems

Publication

Graph transformations: 6th International Conference, ICGT 2012, Bremen, Germany, September 24-29: Proceedings

Volume

7562

First Page

420

Last Page

422

ISBN

9783642336546

Identifier

10.1007/978-3-642-33654-6_30

Publisher

Springer

City or Country

Berlin

Additional URL

https://doi.org/10.1007/978-3-642-33654-6_30

Download

Share

COinS