Please use this identifier to cite or link to this item:
|Title:||Verifying linearizability via optimized refinement checking||Authors:||Dong, Jin Song
Liu, Yanhong A.
Zhang, Shao Jie
|Keywords:||DRNTU::Engineering::Computer science and engineering::Software||Issue Date:||2013||Source:||Liu, Y., Chen, W., Liu, Y. A., Sun, J., Zhang, S. J., & Dong, J. S. (2013).Verifying linearizability via optimized refinement checking. IEEE transactions on software engineering, 39(7), 1018-1039.||Series/Report no.:||IEEE transactions on software engineering||Abstract:||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 respect to the sequential semantics. In this work, we describe a method to automatically check linearizability based on refinement relations from abstract specifications to concrete implementations. The method does not require that linearization points in the implementations be given, which is often difficult or impossible. However, the method takes advantage of linearization points if they are given. The method is based on refinement checking of finite-state systems specified as concurrent processes with shared variables. To tackle state space explosion, we develop and apply symmetry reduction, dynamic partial order reduction, and a combination of both for refinement checking. We have built the method into the PAT model checker, and used PAT to automatically check a variety of implementations of concurrent objects, including the first algorithm for scalable nonzero indicators. Our system is able to find all known and injected bugs in these implementations.||URI:||https://hdl.handle.net/10356/103347
|ISSN:||0098-5589||DOI:||10.1109/TSE.2012.82||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.