Hoare logic for graph programs
We present a new approach for verifying programs written in GP (for Graph Programs), an experimental programming language for performing computations on graphs at a high level of abstraction. Taking a labelled graph as input, a graph program nondeterministically applies to it a number of graph trans...
Saved in:
Main Authors: | POSKITT, Christopher M., PLUMP, Detlef |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2010
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4921 https://ink.library.smu.edu.sg/context/sis_research/article/5924/viewcontent/PoskittPlump.VSTTE_Theory.2010.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A Hoare calculus for graph programs
by: POSKITT, Christopher M., et al.
Published: (2010) -
Hoare-style verification of graph programs
by: POSKITT, Christopher M., et al.
Published: (2012) -
Verifying monadic second-order properties of graph programs
by: POSKITT, Christopher M., et al.
Published: (2014) -
Verifying total correctness of graph programs
by: POSKITT, Christopher M., et al.
Published: (2012) -
Verification of graph programs
by: POSKITT, Christopher M.
Published: (2012)