ESOP 2015
Tue 14 - Thu 16 April 2015 London, United Kingdom
Wed 15 Apr 2015 11:30 - 12:00 at Skeel - Session 4 Chair(s): Lars Birkedal

We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in the program state. Our key observation is that histories form a partial commutative monoid, a structure fundamental for representation of concurrent resources. This insight provides us with a unifying mechanism that allows us to treat histories just like heaps in separation logic. For example, both are subjects to the same assertion logic and inference rules. Moreover, the notion of ownership transfer, which usually applies to heaps, has an equivalent in histories. It can be used to formally represent helping—an important design pattern for concurrent algorithms whereby one thread can execute code on behalf of another. Specifications in terms of histories naturally abstract away the internal interference, so that sophisticated fine-grained algorithms can be given the same specifications as their simplified coarse-grained counterparts, making them equally convenient for client-side reasoning.

Wed 15 Apr
Times are displayed in time zone: (GMT) Azores change

10:30 - 12:30: ESOP - Session 4 at Skeel
Chair(s): Lars BirkedalAarhus University
esop-2015-papers10:30 - 11:00
Mark BattyUniversity of Cambridge, Kayvan MemarianUniversity of Cambridge, Kyndylan NienhuisUniversity of Cambridge, Jean Pichon-PharabodUniversity of Cambridge, Peter SewellUniversity of Cambridge
esop-2015-papers11:00 - 11:30
Parosh Aziz Abdulla, Mohamed Faouzi AtigUppsala University, Tuan Phong NgoUppsala University
esop-2015-papers11:30 - 12:00
Ilya SergeyIMDEA Software Institute, Aleksandar NanevskiIMDEA Software Institute, Anindya BanerjeeIMDEA Software Institute
esop-2015-papers12:00 - 12:30
Jasmin BlanchetteTU Munich, Andrei PopescuMiddlesex University, London, Dmitriy TraytelTU Munich