Skip to main content


Backwards and forwards with separation logic


Callum Bannister, Peter Hoefner and Gerwin Klein



The use of Hoare logic in combination with weakest preconditions and strongest postconditions is a standard tool for program verification, known as backward and forward reasoning. In this paper we extend these techniques to allow backward and forward reasoning for separation logic. While the former is derived directly from the standard operators of separation logic, the latter uses a new operator. We implement our framework in the interactive theorem prover Isabelle/HOL, and enable automation with several interactive proof tactics.

BibTeX Entry

    publisher        = {Lecture Notes in Computer Science},
    doi              = {10.1007/978-3-319-94821-8\_5},
    booktitle        = {International Conference on Interactive Theorem Proving},
    author           = {Bannister, Callum and Hoefner, Peter and Klein, Gerwin},
    month            = jul,
    volume           = {10895},
    year             = {2018},
    date             = {2018-7-9},
    title            = {Backwards and Forwards with Separation Logic},
    pages            = {68--87},
    address          = {Oxford}


Served by Apache on Linux on seL4.