University of Cambridge > > Semantics Lunch (Computer Laboratory) > Ribbon proofs for separation logic

Ribbon proofs for separation logic

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Peter Sewell.

This talk presents a diagrammatic proof system for program verification using separation logic. Joint work with Matthew Parkinson and Mike Dodds.

This talk is part of the Semantics Lunch (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity