J-STAGE Home  >  Publications - Top  > Bibliographic Information

Information and Media Technologies
Vol. 4 (2009) No. 2 pp. 304-316

Language:

http://doi.org/10.11185/imt.4.304

Computing

Separation logic is an extension of Hoare logic to verify imperative programs with pointers and mutable data-structures. 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.

Copyright © 2009 by Japan Society for Software Science and Technology

Article Tools

Share this Article