The Semantics of Graph Programs

Details The Semantics of Graph Programs The Semantics of Graph Programs

2010-03-24

arxiv.org/abs/1003.4563v1

EPTCS 21, 2010, pp. 27-38

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.21.3

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.

Affiliated with

Also associated with

No associations

Rating

The Semantics of Graph Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Semantics of Graph Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Semantics of Graph Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56728