Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning

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

• Kasper Svendsen
• Wednesday 26 November 2014, 13:00-14:00
• SS03.

If you have a question about this talk, please contact Peter Sewell.

nonstandard room: SS03

(joint work with Ralf Jung, David Swasey, Filip Sieczkowski, Aaron Turon, Lars Birkedal and Derek Dreyer)

Abstract: We present Iris, a concurrent separation logic with a simple premise: monoids and invariants are all you need. Partial commutative monoids enable us to express—and invariants enable us to enforce— user-defined protocols on shared state, which are at the conceptual core of most recent program logics for concurrency. Furthermore, through a novel extension of the concept of a view shift, Iris supports the encoding of logically atomic specifications, i.e., Hoare-style specs that permit the client of an operation to treat the operation essentially as if it were atomic, even if it is not.

This talk is part of the REMS lunch series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• SS03
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.