Journal article icon

Journal article

Testing for linearizability

Abstract:

Linearizability is a well-established correctness condition for concurrent datatypes. Informally, a concurrent datatype is linearizable if operation calls appear to have an effect, one at a time, in an order that is consistent with a sequential (specification) datatype, with each operation taking effect between the point at which it is called and when it returns. We present a testing framework for linearizabilty. The basic idea is to generate histories of the datatype randomly, and to test wh...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1002/cpe.3928

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
Publisher:
John Wiley and Sons, Ltd Publisher's website
Journal:
Concurrency and Computation: Practice and Experience Journal website
Volume:
29
Issue:
4
Pages:
Article: e3928
Publication date:
2016-12-20
DOI:
EISSN:
1532-0634
ISSN:
1532-0626
URN:
uuid:c8038e41-29cc-4b67-a68b-47ac1edc0e5c
Source identifiers:
634324
Local pid:
pubs:634324
Paper number:
4

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP