A certified verifier for a fragment of Separation logic (2007)
| Venue: | In JSSST Workshop on Programming and Programming Languages (PPL’07). Japan Society for Software Science and Technology |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Marti07acertified,
author = {Nicolas Marti and Reynald Affeldt},
title = {A certified verifier for a fragment of Separation logic},
booktitle = {In JSSST Workshop on Programming and Programming Languages (PPL’07). Japan Society for Software Science and Technology},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Separation logic is an extension of Hoare logic to verify imperative programs with pointers and mutable datastructures. Although there exist several implementations of verifiers for separation logic, none of them has actually been itself verified. In this paper, we present a verifier for a fragment of separation logic that is verified inside the Coq proof assistant. This verifier is implemented as a Coq tactic by reflection to verify separation logic triples. Thanks to the extraction facility to OCaml, we can also derive a certified, stand-alone and efficient verifier for separation logic. 1
