Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421619 | Electronic Notes in Theoretical Computer Science | 2015 | 16 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics