A Hoare calculus for graph programs
We present Hoare-style axiom schemata and inference rules for verifying the partial correctness of programs in the graph programming language GP. The pre- and postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels in order to d...
Saved in:
Main Authors: | , |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2010
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/4918 https://ink.library.smu.edu.sg/context/sis_research/article/5921/viewcontent/PoskittPlump.ICGT.2010.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |