University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Explicit Stabilisation for Rely-Guarantee reasoning

Explicit Stabilisation for Rely-Guarantee reasoning

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

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

Rely-guarantee (RG) is a compositional method that extends Hoare-style reasoning to concurrent programs. A fundamental tenet is that any assertion we write must be stable, that is, invariant under any interference from concurrently-running threads. One can consider stabilising an assertion, by weakening it (or strengthening it) until it becomes stable. In this talk, I will develop an extension to the RG method, in which stabilisation is not a meta-level operator, but exists within the syntax of assertions. I will show how this can eliminate many side-conditions from the RG proof rules, and, in particular, lead to an elegant proof rule for conditional statements whose tests are evaluated non-atomically. I will further show how explicit stabilisation might improve the modularity of the RG method, thus allowing the verification of libraries.

This talk describes joint work with Matthew Parkinson.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity