Completeness of Pointer Program Verification by Separation Logic
Makoto Tatsuta, Wei-Ngan Chin, Mahmudul Faisal Al Ameen · 2009
Reynolds' separation logical system for pointer program verification is investigated. This paper proves its completeness theorem as well as the expressiveness theorem that states the weakest precondition of every program and every assertion can be expressed by some assertion. 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.