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
-
Linearizable Counting Networks
by: Merlihy, Maurice, et al.
Published: (2023) -
Using monterey phoenix to formalize and verify system architectures
by: Zhang, Jiexin, et al.
Published: (2013) -
Model checking software architecture design
by: Zhang, Jiexin, et al.
Published: (2013) -
Towards model checking android applications
by: Bai, Guangdong, et al.
Published: (2020) -
Anti-chain based algorithms for timed/probabilistic refinement checking
by: Wang, Ting, et al.
Published: (2020)