University of Cambridge > > Churchill CompSci Talks > Introduction to Separation Logic

Introduction to Separation Logic

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

If you have a question about this talk, please contact John Wickerson.

Note unusual time

Hoare logic is widely known as the basis for most verification techniques. But traditional methods of program verification break down when faced with the need to reason over data structures in the heap. In this talk we present an extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structures.

This talk is part of the Churchill CompSci Talks 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