Difference between revisions of "GP (Graph Programs)"
From The Programming Languages and Systems Research Group
(→Possible Research Projects) |
|||
Line 1: | Line 1: | ||
− | '''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. The language has a structural operational semantics, as well as a prototype implementation. | + | {|width=100% |
+ | |valign="top"|'''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. The language has a structural operational semantics, as well as a prototype implementation. | ||
[[Members#sandra|Sandra Steinert]], [[Members#gm|Greg Manning]], and [[Members#det|Detlef Plump]] worked on the design and implementation of GP; [[Members#cposkitt|Chris Poskitt]] and [[Members#det|Detlef Plump]] are currently investigating the formal verification of Graph Programs. | [[Members#sandra|Sandra Steinert]], [[Members#gm|Greg Manning]], and [[Members#det|Detlef Plump]] worked on the design and implementation of GP; [[Members#cposkitt|Chris Poskitt]] and [[Members#det|Detlef Plump]] are currently investigating the formal verification of Graph Programs. | ||
Line 30: | Line 31: | ||
More information about these possible projects (and others) are available on [[Prospective Research Students#Subject_Area:_Programming_by_Graph_Transformation_.28Detlef_Plump_.5B3.5D.29|our prospective research students page]]. | More information about these possible projects (and others) are available on [[Prospective Research Students#Subject_Area:_Programming_by_Graph_Transformation_.28Detlef_Plump_.5B3.5D.29|our prospective research students page]]. | ||
+ | |||
+ | |valign=top|[[Image:ExampleGraphProgramCheckForest.png|thumb|border|500px|'''CheckForest:''' example graph program for testing whether a graph is a forest.]] | ||
+ | |} | ||
[[Category:Graph Transformation]] | [[Category:Graph Transformation]] |
Revision as of 19:34, 2 March 2010
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. The language has a structural operational semantics, as well as a prototype implementation.
Sandra Steinert, Greg Manning, and Detlef Plump worked on the design and implementation of GP; Chris Poskitt and Detlef Plump are currently investigating the formal verification of Graph Programs. ContentsGP LiteratureOverviews
Semantics
Prototype Implementation
Possible Research ProjectsPlease contact Detlef Plump for more information about the following possible Ph.D. projects.
More information about these possible projects (and others) are available on our prospective research students page. |