Verification of graph programs

• Main Author: POSKITT, Christopher M.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2012
• Subjects: Graph theory; graph transformations; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/4917; https://ink.library.smu.edu.sg/context/sis_research/article/5920/viewcontent/Poskitt.ICGT_DS.2012.pdf
• Institution: Singapore Management University

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.