|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 listsCentre for Smart Infrastructure & Construction Seminars Cambridge University Medical Humanities Society Type the title of a new list here
Other talksCan the UK cook its way to better health? Woofing it down – lessons on the neurobiology of appetite from man’s best friend BP Day - Materials RIG Labouring in early modern London Ratio measurements at ATLAS: More sensitivity to constrain Parton Distributions Limit theorems for eigenvectors of the normalized Laplacian for random graphs