Verification of graph programs
GP (for Graph Programs) is an experimental nondeterministic programming language which allows for the manipulation of graphs at a high level of abstraction. The program states of GP are directed labelled graphs. These are manipulated directly via the application of (conditional) rule schemata, which...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2012
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/4917 https://ink.library.smu.edu.sg/context/sis_research/article/5920/viewcontent/Poskitt.ICGT_DS.2012.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |