University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > Separation Algebra

Separation Algebra

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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