Hoare-style verification of graph programs

Hoare-style verification of graph programs

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...

Full description

Saved in:
Bibliographic Details
Main Authors: POSKITT, Christopher M., PLUMP, Detlef
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2012
Subjects:
Graphics and Human Computer Interfaces
Software Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/4859
https://ink.library.smu.edu.sg/context/sis_research/article/5862/viewcontent/PoskittPlump.FundInf.2012__1_.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/4859
https://ink.library.smu.edu.sg/context/sis_research/article/5862/viewcontent/PoskittPlump.FundInf.2012__1_.pdf

Similar Items