Separation Algebra

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

• Tony Hoare - Microsoft Research
• Tuesday 31 May 2011, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

If you have a question about this talk, please contact William Denman.

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?

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• 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
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.