Results 1 
2 of
2
Ribbon Proofs for Separation Logic
"... Abstract—We present a diagrammatic system for constructing and presenting readable program proofs in separation logic. A program proof should not merely certify that a program is correct; it should explain why it is correct. By examining a proof, one should gain understanding of both the program bei ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract—We present a diagrammatic system for constructing and presenting readable program proofs in separation logic. A program proof should not merely certify that a program is correct; it should explain why it is correct. By examining a proof, one should gain understanding of both the program being considered and the proof technique being used. To
Ribbon Proofs for Separation Logic A verification pearl
"... We present ribbon proofs, a diagrammatic proof system for separation logic. Inspired by an eponymous system due to Bean, ribbon proofs emphasise the structure of a proof, so are intelligible and hence useful pedagogically. Because they contain less redundancy than proof outlines, and allow each proo ..."
Abstract
 Add to MetaCart
We present ribbon proofs, a diagrammatic proof system for separation logic. Inspired by an eponymous system due to Bean, ribbon proofs emphasise the structure of a proof, so are intelligible and hence useful pedagogically. Because they contain less redundancy than proof outlines, and allow each proof step to be checked locally, they are highly scalable (and we illustrate this with a ribbon proof of the Version 7 Unix memory manager). 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. 1.