© 2015 Published by Elsevier B.V.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
Despite recent advances in reasoning about concurrent data structure libraries, the largest implemen...
A method is presented for programming correct and efficient cooperation in a set of sequential modul...
Verification of concurrent systems is difficult because of the inherent nondeterminism. Modern verif...
The specification of a concurrent program module is a difficult problem. The specifications must be ...
The specification of a concurrent program module, and the verification of implementations and client...
. We propose a specification language for shared-variable concurrent programs based on Morgan's...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
Abstract. We look at approaches to specifying concurrent program modules based on disjointness (the ...
As the use of concurrent software is increasing, we urgently need techniques to establish the correc...
Software is large, complex, and error-prone. According to the US National Institute of Standards and...
Verification of distributed systems is a challenging problem, especially if the distributed system a...
Modern concurrent and distributed software is highly complex. Techniques to reason about the correct...
International audienceModular static verification of concurrent object-oriented programs remains a c...
This paper proposes a method to construct a set of proof obligations from the architectural specific...
Compared to coarse-grained external synchronization of operations on data structures shared between ...
Despite recent advances in reasoning about concurrent data structure libraries, the largest implemen...
A method is presented for programming correct and efficient cooperation in a set of sequential modul...
Verification of concurrent systems is difficult because of the inherent nondeterminism. Modern verif...
The specification of a concurrent program module is a difficult problem. The specifications must be ...
The specification of a concurrent program module, and the verification of implementations and client...
. We propose a specification language for shared-variable concurrent programs based on Morgan's...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
Abstract. We look at approaches to specifying concurrent program modules based on disjointness (the ...
As the use of concurrent software is increasing, we urgently need techniques to establish the correc...
Software is large, complex, and error-prone. According to the US National Institute of Standards and...
Verification of distributed systems is a challenging problem, especially if the distributed system a...
Modern concurrent and distributed software is highly complex. Techniques to reason about the correct...
International audienceModular static verification of concurrent object-oriented programs remains a c...
This paper proposes a method to construct a set of proof obligations from the architectural specific...
Compared to coarse-grained external synchronization of operations on data structures shared between ...
Despite recent advances in reasoning about concurrent data structure libraries, the largest implemen...
A method is presented for programming correct and efficient cooperation in a set of sequential modul...
Verification of concurrent systems is difficult because of the inherent nondeterminism. Modern verif...