![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 28 October 2008, 13:00-14:00
Towards Automatic Stability Analysis for Rely-Guarantee Proofs
- đ¤ Speaker: Hasan Amjad (Middlesex University)
- đ Date & Time: Tuesday 28 October 2008, 13:00 - 14:00
- đ Venue: Computer Laboratory, William Gates Building, Room SS03
Questions? Contact
Thomas Tuerk
Abstract
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.
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Automated Reasoning Group Lunches
- Computer Laboratory, William Gates Building, Room SS03
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.