Providing a Fiction of Disjoint Concurrency

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

• Mike Dodds, University of Cambridge
• Friday 16 October 2009, 14:00-15:00
• UG40 Computer Science.

If you have a question about this talk, please contact Paul Levy.

Abstraction is the key to understanding large computer systems. In sequential separation logic, heap structures are disjoint, so they can easily be treated abstractly. In concurrent verification, threads may share structures in complex ways, removing disjointness and making abstraction more challenging. We have developed a verification system for concurrency that allows abstraction. The internal details of a concurrent module are completely hidden from the client, providing a high-level fiction of disjointness. We reason about the module implementation using an extension of deny-guarantee logic, and hide the details from the client using abstract predicates. Our system allows us to reason about higher-level modules using abstract specifications for lower-level modules, giving a powerful technique for modular reasoning about complex concurrent programs.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Theoretical computer science seminar
• UG40 Computer Science
• computer sience

Note that ex-directory lists are not shown.