Venue

Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics (MFPS’15), pp. 3–18

Publication Year

2015

Identifiers

Authors

Abstract

The specification of a concurrent program module is a difficult problem. The specifications must be strong enough to enable reasoning about the intended clients without reference to the underlying module implementation. We survey a range of verification techniques for specifying concurrent modules, in particular highlighting four key concepts: auxiliary state, interference abstraction, resource ownership and atomicity. We show how these concepts combine to provide powerful approaches to specifying concurrent modules.

Source Materials