Verifying Total Correctness of Graph Programs

Selected Revised Papers from the 4th International Workshop on Graph Computation Models (GCM 2012)
Download
Text (PDF, 217.4Kb)
Thumbnail
Open access
Author
Poskitt, Christopher M.
Plump, Detlef
Date
2013
Type
    Conference Paper
Rights / license
In Copyright - Non-Commercial Use Permitted
Permanent link
https://doi.org/10.3929/ethz-a-009790053
Publication status
published
Book title
Selected Revised Papers from the 4th International Workshop on Graph Computation Models (GCM 2012)
Journal / series
Electronic Communications of the EASST
Volume
61
Publisher
Techn. Univ.
Event
4th International Workshop on Graph Computation Models (GCM 2012), Bremen, Germany, September 28-29, 2012
Subject
Termination; Graph programs; GRAPHENALGORITHMEN + GEOMETRISCHE ALGORITHMEN (GRAPHENTHEORIE); Total correctness; Verification; KORREKTHEIT (THEORIE DER PROGRAMMIERUNG); Hoare logic; CORRECTNESS (THEORY OF PROGRAMMING); GRAPH ALGORITHMS + GEOMETRIC ALGORITHMS (GRAPH THEORY)
Organisational unit
03594 - Meyer, Bertrand (emeritus)  
More
Show all metadata
ETH Bibliography
yes
Altmetrics