![[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 31 May 2011, 13:00-14:00
Separation Algebra
- đ¤ Speaker: Tony Hoare - Microsoft Research
- đ Date & Time: Tuesday 31 May 2011, 13:00 - 14:00
- đ Venue: Computer Laboratory, William Gates Building, Room SS03
Questions? Contact
William Denman
Abstract
Separation Algebra provides a simple semantics for concurrent programming. Other kinds of semantics (deductive, operational, refinement) are easily derived from it, as I will show. Will this help proof tools to reason directly about programs, rather than indirectly through verification conditions?
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.