![]() |
University of Cambridge > Talks.cam > Semantics Lunch (Computer Laboratory) > Verifying malloc using RGSep and 'Explicit Stabilisation'
Verifying malloc using RGSep and 'Explicit Stabilisation'Add to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Sam Staton. The talk will introduce a new formalisation of stability for Rely-Guarantee, in which an assertion’s stability is encoded into its syntactic form. I’ll briefly show how this allows library code to be specified independently of its various calling environments. But the main thrust of the talk concerns how this so-called ‘explicit stabilisation’ can be applied to RGSep, a recent addition to the Rely-Guarantee family. Doing so enables an ‘InfoHiding’ rule, which describes how a (sequential) module can hide its ‘internal interference’ from clients. We illustrate with a proof of the memory management module from Version 7 Unix. 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 Network Healthcare SIG Beer Talks Phonetics & Phonology Research ClusterOther talksFinite volume fountains and dense vortices Random rigidity in the free group Frontotemporal dementia – a neuropsychiatric perspective Rhetoric and standardization in Milgram's obedience experiments "Conformational Telecommunication: From Atropisomers towards Artificial Receptors" Fermionic T-duality |