TY - GEN

T1 - Ribbon proofs for separation logic

AU - Wickerson, John

AU - Dodds, Mike

AU - Parkinson, Matthew J.

PY - 2013/3/16

Y1 - 2013/3/16

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-37036-6_12

DO - 10.1007/978-3-642-37036-6_12

M3 - Conference contribution

SN - 978-3-642-37035-9

VL - 7792 LNCS

T3 - Lecture Notes in Computer Science

SP - 189

EP - 208

BT - Programming Languages and Systems

PB - ACM

T2 - 22nd European conference on Programming Languages and Systems (ESOP 2013)

Y2 - 16 March 2013 through 24 March 2013

ER -