Separation Algebra


Title: Separation Algebra
Authors: Gerwin Klein, Rafal Kolanski and Andrew Boyton (andrew /dot/ boyton /at/ nicta /dot/ com /dot/ au)
Submission date: 2012-05-11
Abstract: We present a generic type class implementation of separation algebra for Isabelle/HOL as well as lemmas and generic tactics which can be used directly for any instantiation of the type class.

The ex directory contains example instantiations that include structures such as a heap or virtual memory.

The abstract separation algebra is based upon "Abstract Separation Logic" by Calcagno et al. These theories are also the basis of the ITP 2012 rough diamond "Mechanised Separation Algebra" by the authors.

The aim of this work is to support and significantly reduce the effort for future separation logic developments in Isabelle/HOL by factoring out the part of separation logic that can be treated abstractly once and for all. This includes developing typical default rule sets for reasoning as well as automated tactic support for separation logic.

  author  = {Gerwin Klein and Rafal Kolanski and Andrew Boyton},
  title   = {Separation Algebra},
  journal = {Archive of Formal Proofs},
  month   = may,
  year    = 2012,
  note    = {\url{},
            Formal proof development},
  ISSN    = {2150-914x},
License: BSD License
Used by: Separata