|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Separation Logic and Graphical Models
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:
Note that ex-directory lists are not shown.
Other listsCambridge University Caving Club (CUCC) talks and events Epigenetics and Stem Cells 2012 British Antarctic Survey's Natural Complexity: Data and Theory in Dialogue
Other talksUpside Down and Inside Out: The Biomechanics of Cell Sheet Folding Unorthodox Interactions at Work Interlocking directorates in Irish companies using bipartite networks: a latent space approach Exchangeable constructions of countable structures Mesembryanthemums Goodness of fit of logistic models for random graphs