J-STAGE トップ  >  資料トップ  > 書誌事項

コンピュータ ソフトウェア
Vol. 25 (2008) No. 3 P 3_135-3_147



  • 抄録

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 © 日本ソフトウェア科学会 2008