University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > Towards Automatic Stability Analysis for Rely-Guarantee Proofs

Towards Automatic Stability Analysis for Rely-Guarantee Proofs

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

If you have a question about this talk, please contact Thomas Tuerk.

The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved invariant (or stable) under interference from the environment. I’ll talk about progress towards a method for automatically detecting and repairing instability in such proofs (and all the concomitant limitations of such automation). The method uses a combination of model checking, abstract interpretation, SMT and flow-control refinement. This is joint work with Richard Bornat.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches 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