The Semantics of Graph Programs
Logic in Computer Science
2010-04-08 v1 Programming Languages
Abstract
GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handling low-level data structures. The core of GP consists of four constructs: single-step application of a set of conditional graph-transformation rules, sequential composition, branching and iteration. We present a formal semantics for GP in the style of structural operational semantics. A special feature of our semantics is the use of finitely failing programs to define GP's powerful branching and iteration commands.
Cite
@article{arxiv.1003.4563,
title = {The Semantics of Graph Programs},
author = {Detlef Plump and Sandra Steinert},
journal= {arXiv preprint arXiv:1003.4563},
year = {2010}
}