Ribbon Proofs for Separation Logic

  • John Wickerson
  • Mike Dodds
  • Matthew Parkinson
Conference paper

DOI: 10.1007/978-3-642-37036-6_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7792)
Cite this paper as:
Wickerson J., Dodds M., Parkinson M. (2013) Ribbon Proofs for Separation Logic. In: Felleisen M., Gardner P. (eds) Programming Languages and Systems. ESOP 2013. Lecture Notes in Computer Science, vol 7792. Springer, Berlin, Heidelberg

Abstract

We present ribbon proofs, a diagrammatic system for proving program correctness based on separation logic. Ribbon proofs emphasise the structure of a proof, so are intelligible and pedagogical. Because they contain less redundancy than proof outlines, and allow each proof step to be checked locally, they may be more scalable. Where proof outlines are cumbersome to modify, ribbon proofs can be visually manoeuvred to yield proofs of variant programs. This paper introduces the ribbon proof system, proves its soundness and completeness, and outlines a prototype tool for validating the diagrams in Isabelle.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • John Wickerson
    • 1
  • Mike Dodds
    • 2
  • Matthew Parkinson
    • 3
  1. 1.Technische Universität BerlinGermany
  2. 2.University of YorkUnited Kingdom
  3. 3.Microsoft Research CambridgeUnited Kingdom

Personalised recommendations