![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
John Wickerson (University of Cambridge)
Monday 25 October 2010, 12:45-14:00
Separation Logic and Graphical Models
- 👤 Speaker: John Wickerson (University of Cambridge)
- 📅 Date & Time: Monday 25 October 2010, 12:45 - 14:00
- 📍 Venue: Room FW26, Computer Laboratory, William Gates Building
Questions? Contact
Sam Staton
Abstract
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.
Series This talk is part of the Semantics Lunch (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- Room FW26, Computer Laboratory, William Gates Building
- School of Technology
- Semantics Lunch (Computer Laboratory)
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.