Differences between revisions 28 and 29
Revision 28 as of 2011-05-24 16:59:56
Size: 6291
Editor: beta
Comment:
Revision 29 as of 2011-05-24 17:00:15
Size: 6292
Editor: beta
Comment:
Deletions are marked like this. Additions are marked like this.
Line 26: Line 26:
|| Monday 2011-05-23, '''''12:15'''''. || Concurrent separation logic || Beta || [[attachment:slides-beta-2011-05-23.pdf|slide]] || || Monday 2011-05-23, '''''12:15'''''. || Concurrent separation logic || Beta || [[attachment:slides-beta-2011-05-23.pdf|slides]] ||

Concurrent Program Logics

Instructors: Viktor Vafeiadis and Derek Dreyer

Teaching assistant: Georg Neis

Meeting time: 2 hours, once a week, April - July 2011

Abstract

Reasoning about concurrent programming is a particularly exciting topic in program verification. The focus of much of the research in this area is on developing modular and compositional methods for verification that nonetheless allow for fine-grained synchronization, as well as the sharing of mutable data structures, between multiple threads. Although some of the fundamental ideas in the area (such as Hoare logic and rely-guarantee reasoning) were developed thirty years ago, there has been major progress in the last several years, and the field is complex and highly active.

In this seminar course, we will study the development of concurrent program logics, from their roots in the late '70s up to the most recent breakthrough technologies. The course will be structured like a reading group, with one student tasked with presenting a paper each week, followed by an in-depth discussion.

The course is being co-taught by Viktor Vafeiadis (MPI-SWS, the Kaiserslautern branch) and Derek Dreyer (MPI-SWS, the Saarbruecken branch), and will be conducted by videoconferencing between the two MPI-SWS locations.

Schedule

Date and time

Topic

Presenter

Files

Monday 2011-04-11, 12:15.

Introduction, Hoare logic

Viktor

slides

Monday 2011-04-17.

No meeting (Easter holiday)

Monday 2011-04-25.

No meeting (Easter holiday)

Monday 2011-05-02, 16:15.

Owicki-Gries

Jonas

slides example

Monday 2011-05-09, 16:15.

Rely-guarantee

Georg

slides example

Monday 2011-05-16, 16:15.

Separation logic

Sigurd

slides

Monday 2011-05-23, 12:15.

Concurrent separation logic

Beta

slides

Monday 2011-05-30, 16:15.

Permissions

Matt

Monday 2011-06-06, 16:15.

Abstract predicates

Scott

Monday 2011-06-13, 16:15.

Storable locks

Monday 2011-06-20.

No meeting (LICS)

Monday 2011-06-27, 16:15.

RGSep

Monday 2011-07-04, 16:15.

More RGSep, LRG

Monday 2011-07-11, 16:15.

Deny-guarantee

Georg

Monday 2011-07-18, 16:15.

Concurrent abstract predicates

Gil

Monday 2011-07-25, 16:15.

More DG

Reading list

Early papers

Rely/guarantee

Separation logic

Concurrent Separation Logic

Permissions

Hypothetical frame rule, abstract predicates

  • Peter W. O'Hearn, Hongseok Yang, John C. Reynolds: Separation and information hiding. POPL 2004.
  • Matthew J. Parkinson, Gavin M. Bierman: Separation logic and abstraction. POPL 2005.

Storable locks

  • Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, Mooly Sagiv: Local Reasoning for Storable Locks and Threads. APLAS 2007
  • Aquinas Hobor, Andrew W. Appel, Francesco Zappa Nardelli: Oracle Semantics for Concurrent Separation Logic. ESOP 2008
  • A. Buisse, L. Birkedal, and K. Støvring: A step-indexed kripke model of separation logic for storable locks. MFPS 2011

RGSep, LRG

  • Viktor Vafeiadis, Matthew J. Parkinson: A Marriage of Rely/Guarantee and Separation Logic. CONCUR 2007.
  • Viktor Vafeiadis. Modular fine-grained concurrency verification. PhD thesis. Chapter 3.
  • Xinyu Feng: Local rely-guarantee reasoning. POPL 2009: 315-327

Deny-guarantee, concurrent abstract predicates

  • Mike Dodds, Xinyu Feng, Matthew J. Parkinson, Viktor Vafeiadis: Deny-Guarantee Reasoning. ESOP 2009: 363-377
  • Thomas Dinsdale-Young, Mike Dodds, Philippa Gardner, Matthew J. Parkinson, Viktor Vafeiadis: Concurrent Abstract Predicates. ECOOP 2010: 504-528

cpl (last edited 2011-07-25 23:44:25 by dreyer)