Information and Media Technologies
Online ISSN : 1881-0896
Computing
A Certified Verifier for a Fragment of Separation Logic
Nicolas MartiReynald Affeldt
Author information
JOURNALS FREE ACCESS

Volume 4 (2009) Issue 2 Pages 304-316

Details
Download PDF (276K) Contact us
Abstract

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.

Information related to the author
© 2009 by Japan Society for Software Science and Technology
Previous article Next article

Recently visited articles
feedback
Top