Abstract
GP 2 is a non-deterministic programming language for computing by graph transformation. One of the design goals for GP 2 is syntactic and semantic simplicity, to facilitate formal reasoning about programs. In this paper, we demonstrate with four case studies how programmers can prove termination and partial correctness of their solutions. We argue that GP 2's graph transformation rules, together with induction over the length of program executions, provide a convenient framework for program verification.
Original language | English |
---|---|
Title of host publication | Proceedings 9th International Workshop on Computing with Terms and Graphs (TERMGRAPH 2016) |
Editors | Andrea Corradini, Hans Zantema |
Publisher | Open Publishing Association |
Pages | 35-44 |
Number of pages | 10 |
Volume | 225 |
DOIs | |
Publication status | Published - 2016 |
Publication series
Name | Electronic Proceedings in Theoretical Computer Science |
---|---|
Volume | 225 |
Bibliographical note
Publisher Copyright:© D. Plump.