Reasoning about Graph Programs

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.

Metadata

Item Type:	Proceedings Paper
Authors/Creators:	Plump, Detlef https://orcid.org/0000-0002-1148-822X
Editors:	Corradini, Andrea Zantema, Hans
Copyright, Publisher and Additional Information:	Publisher Copyright: © D. Plump.
Dates:	Published: 2016
Institution:	The University of York
Academic Units:	The University of York > Faculty of Sciences (York) > Computer Science (York)
Depositing User:	Pure (York)
Date Deposited:	10 Jan 2023 17:00
Last Modified:	24 Oct 2024 00:27
Published Version:	https://doi.org/10.4204/EPTCS.225.6
Status:	Published
Publisher:	Open Publishing Association
Series Name:	Electronic Proceedings in Theoretical Computer Science
Identification Number:	10.4204/EPTCS.225.6
Related URLs:	http://www.scopus.com/inward/record.url?... http://www.cs.york.ac.uk/plasma/publicat...
Open Archives Initiative ID (OAI ID):	oai:eprints.whiterose.ac.uk:195050