Separation Logic and Graphical Models

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

• John Wickerson (University of Cambridge)
• Monday 25 October 2010, 12:45-14:00
• Room FW26, Computer Laboratory, William Gates Building.

If you have a question about this talk, please contact Sam Staton.

We describe work in progress to develop a new model of Separation Logic that is based not on heaps, but on execution traces. The star-operator now composes not sets of heaps (i.e. assertions), but sets of traces—that is, programs. We then use the star-operator to define a compositional denotational semantics for a concurrent programming language. Happily, we can use the laws of Separation Logic to reason algebraically about our semantics.

This talk is based on joint work with Tony Hoare.

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

This talk is included in these lists:

• All Talks (aka the CURE list)
• Computer Laboratory talks
• Room FW26, Computer Laboratory, William Gates Building
• School of Technology
• Semantics Lunch (Computer Laboratory)
• de239's list

Note that ex-directory lists are not shown.