University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Fine-grained concurrency with separation logic

Fine-grained concurrency with separation logic

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

  • UserUday Reddy, University of Birmingham
  • ClockFriday 01 December 2006, 14:00-15:00
  • HouseFW11.

If you have a question about this talk, please contact Tom Ridge.

(joint work with Kalpesh Kapoor and Kamal Lodaya)

Separation Logic is a recent development in programming logic which has been applied by Peter O’Hearn to concurrency based on critical sections as well as semaphores. In this work, we go one step further and apply it to fine-grained concurrency. We note that O’Hearn’s formulation of Concurrent Separation Logic is by and large applicable to fine-grained concurrent programs with only minor adaptations. However, proving substantial properties of such programs involves the employment of sophisticated ``permissions’’ frameworks so that different processes can have different levels of access and exchange such access.

We illustrate these techniques by showing the correctness proof of a concurrent garbage collector originally studied by Dijkstra et al. The original proof is based on informal reasoning, and it is said to have been very challenging to ensure its validity. Our techniques formalise this proof, but we find that there are significant details that need to be filled in.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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