Verifying monadic second-order properties of graph programs
The core challenge in a Hoare- or Dijkstra-style proof system for graph programs is in defining a weakest liberal precondition construction with respect to a rule and a postcondition. Previous work addressing this has focused on assertion languages for first-order properties, which are unable to exp...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2014
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/sis_research/4912 https://ink.library.smu.edu.sg/context/sis_research/article/5915/viewcontent/PoskittPlump.ICGT.2014.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|