The Community for Technology Leaders
Green Image
Issue No. 07 - July (2013 vol. 39)
ISSN: 0098-5589
pp: 1018-1039
Yang Liu , Nanyang Technological University, Singapore
Wei Chen , Microsoft Research Asia, Beijing
Yanhong A. Liu , State University of New York at Stony Brook, Stony Brook
Jun Sun , Singapore University of Technology and Design, Singapore
Shao Jie Zhang , National University of Singapore, Singapore
Jin Song Dong , National University of Singapore, Singapore
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.
History, Sun, Educational institutions, Optimization, Electronic mail, Semantics, PAT, Linearizability, refinement, model checking

W. Chen, Y. A. Liu, J. Sun, S. J. Zhang, J. S. Dong and Y. Liu, "Verifying Linearizability via Optimized Refinement Checking," in IEEE Transactions on Software Engineering, vol. 39, no. , pp. 1018-1039, 2013.
95 ms
(Ver 3.3 (11022016))