Monday November 23, 2009 and Tuesday November 24, 2009
Room 701, Claremont Tower
Newcastle Upon Tyne
The successor to this conference is the Cambridge Concurrency Workshop to be held on the 5th and 6th of July, 2010.
The successor to that is the Dublin Concurrency Workshop to be held on the 14th and 15th of April, 2011. See you there.
This workshop follows the Concurrency Theory Workshop organized by Peter O'Hearn in London in January 2009 and is the second such workshop aimed at researchers in concurrency theory and related topics.
Many thanks to all of the speakers and participants for a very productive conference; it was a pleasure to run.
|12:00 – 13:00||Arrival; Lunch|
|13:00 – 15:00||Welcome; Introductions|
|Adrian Francalanza — Separation-Based Reasoning for Message Passing Concurrency [slides]|
|Thomas Dinsdale-Young — Justifying Abstract Local Reasoning [slides]|
|Cliff Jones — Rely/Guarantee for race-free reasoning [slides, related paper PDF]|
|15:00 – 15:30||Break|
|15:30 – 17:00||John Wickerson — Verifying malloc [slides, related paper PDF]|
|Ken Pierce — Rely/Guarantee Frames [slides]|
|Mike Dodds — A Modular Lock Specification [slides]|
|18:30 –||Dinner at Pani's (Italian)|
|09:00 – 10:15||Alastair Donaldson — Automatic Analysis of Scratch-pad Memory Code for Heterogeneous Multicore Processors [slides, related paper PDF]|
|Vasileios Koutavas — First-Order Reasoning for Higher-Order Concurrency [slides, related paper PDF]|
|10:30 – 11:00||Break|
|10:00 – 11:30||Bart Jacobs — Fine-grained concurrency verification without using observational equivalence [slides, related paper link]|
|Richard Bornat — Simpson's & Harris' algorithm(s) are linearisable [slides, related paper PDF]|
|11:30 – 12:30||Where do we go from here?; Close; Exeunt|