NII Technical Reports
National Institute of Informatics
| Title | Completeness of Pointer Program Verification by Separation Logic |
| Authors | Makoto Tatsuta, Wei-Ngan Chin, and Mahmudul Faisal Al Ameen |
| Abstract | Reynolds' separation logical system for pointer program verification is investigated. This paper proves its completeness theorem as well as the expressiveness theorem of Peano arithmetic language for the system under the standard interpretation. This paper also introduces the predicate that represents the next new cell, and proves the completeness and the soundness of the extended system under deterministic semantics. |
| Language | English |
| Published | Jun 9, 2009 |
| Pages | 14p |
| PDF File | 09-013E.pdf |