Correctness conditions like linearizability and opacity describe some form of atomicity imposed on concurrent objects. In this paper, we propose a correctness condition (called causal atomicity) for concurrent objects executing in a weak memory model, where the histories of the objects in question are partially ordered. We establish compositionality and abstraction results for causal atomicity and develop an associated refinement-based proof technique
Specification and verification techniques for abstract data types that have been successful for sequ...
In this paper we present a framework for defining linearizability on weak memory models. The purpose...
It has been observed in previous work that it is desirable to avoid causal violations in any executi...
Correctness conditions like linearizability and opacity describe some form of atomicity imposed on c...
In this paper we develop a theory for correctness of concurrent objects under weak memory models. Ce...
In the interleaving model of concurrency, where events are totally ordered, linearizability is compo...
Correctness conditions for concurrent objects describe how atomicity of an abstract sequential objec...
In the interleaving model of concurrency, where events are totally ordered, linearizability is compo...
Most work on the verification of concurrent objects for shared memory assumes sequential consistency...
Linearisability is the de facto standard correctness condition for concurrent objects. Classical li...
Correctness of concurrent objects is defined in terms of conditions that determine allowable relatio...
The abstraction of a shared memory is of growing importance in distributed computing systems. Trad...
Developing correct and performant concurrent systems is a major challenge. When programming an appli...
Correctness of concurrent objects is defined in terms of conditions that determine allowable relatio...
In this paper, we establish a notion of causality that should be used as a desideratum for memory mo...
Specification and verification techniques for abstract data types that have been successful for sequ...
In this paper we present a framework for defining linearizability on weak memory models. The purpose...
It has been observed in previous work that it is desirable to avoid causal violations in any executi...
Correctness conditions like linearizability and opacity describe some form of atomicity imposed on c...
In this paper we develop a theory for correctness of concurrent objects under weak memory models. Ce...
In the interleaving model of concurrency, where events are totally ordered, linearizability is compo...
Correctness conditions for concurrent objects describe how atomicity of an abstract sequential objec...
In the interleaving model of concurrency, where events are totally ordered, linearizability is compo...
Most work on the verification of concurrent objects for shared memory assumes sequential consistency...
Linearisability is the de facto standard correctness condition for concurrent objects. Classical li...
Correctness of concurrent objects is defined in terms of conditions that determine allowable relatio...
The abstraction of a shared memory is of growing importance in distributed computing systems. Trad...
Developing correct and performant concurrent systems is a major challenge. When programming an appli...
Correctness of concurrent objects is defined in terms of conditions that determine allowable relatio...
In this paper, we establish a notion of causality that should be used as a desideratum for memory mo...
Specification and verification techniques for abstract data types that have been successful for sequ...
In this paper we present a framework for defining linearizability on weak memory models. The purpose...
It has been observed in previous work that it is desirable to avoid causal violations in any executi...