Verifying total correctness of graph programs
GP 2 is an experimental nondeterministic programming language based on graph transformation rules, allowing for visual programming and the solving of graph problems at a high-level of abstraction. In previous work we demonstrated how to verify graph programs using a Hoare-style proof calculus, but o...
Saved in:
Main Authors: | POSKITT, Christopher M., PLUMP, Detlef |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2012
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/4916 https://ink.library.smu.edu.sg/context/sis_research/article/5919/viewcontent/PoskittPlump.GCM_ECEASST.2013.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |
相似書籍
-
Verifying monadic second-order properties of graph programs
由: POSKITT, Christopher M., et al.
出版: (2014) -
A Hoare calculus for graph programs
由: POSKITT, Christopher M., et al.
出版: (2010) -
Enhancing Total Correctness Proofs in Program Verification
由: LE TON CHANH
出版: (2015) -
Verification of graph programs
由: POSKITT, Christopher M.
出版: (2012) -
Monadic second-order incorrectness logic for GP 2
由: POSKITT, Christopher M., et al.
出版: (2023)