|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 4 of 7 found articles
| Title: |
Hoare-Style Verification of Graph Programs |
| Author: |
Poskitt, Christopher M. Plump, Detlef |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 118 (2012) nr. 1-2 pages 135-175 |
| Year: |
2012-06-08 |
| Contents: |
GP (for Graph Programs) is an experimental nondeterministic programming language for solving problems on graphs and graph-like structures. The language is based on graph transformation rules, allowing visual programming at a high level of abstraction. In particular, GP frees programmers from dealing with low-level data structures. In this paper, we present a Hoare-style proof system for verifying the partial correctness of (a subset of) graph programs. The pre- and post-conditions of the calculus are nested graph conditions with expressions, a formalism for specifying both structural graph properties and properties of labels. We show that our proof system is sound with respect to GP's operational semantics and give examples of its use. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 4 of 7 found articles
| << previous | next >> |