Verifying linearizability via optimized refinement checking
Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires checking that: (1) All executions of concurrent operations are serializable, and (2) the serialized executions are correct with re...
Main Authors: | Dong, Jin Song, Liu, Yanhong A., Zhang, Shao Jie, Sun, Jun, Liu, Yang, Chen, Wei |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/103347 http://hdl.handle.net/10220/16936 |
Similar Items
-
Faster linearizability checking via P-compositionality
by: Horn, A, et al.
Published: (2015) -
Faster linearizability checking via P-compositionality
by: Horn, A, et al.
Published: (2015) -
Parameterised linearizability
by: Yang, H, et al.
Published: (2014) -
The Importance of Being Linearizable
by: Gotsman, A, et al.
Published: (2011) -
Testing for linearizability
by: Lowe, G
Published: (2016)