Sequential Verification of Serializability

Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verified by considering only its sequential executions. In many cases, concurrent modules guarantee serializability by using standard locking protocols, such as tree locking or two-phase locking. Unfortunately, according to the existing literature, verifying that a concurrent module adheres to these protocols requires considering concurrent interleavings. In this paper, we show that adherence to a large class of locking protocols (including tree locking and two-phase locking) can be verified by considering only sequential executions. The main consequence of our results is that in many cases, the (manual or automatic) verification of serializability can itself be done using sequential reasoning. Categories and Subject Descriptors D.2.4 [Software Engineer

• Type: Conference
• Year: 2010
• Where: POPL
• Authors: G. Ramalingam, Hagit Attiya, Noam Rinetzky
• Keywords: Concurrent Module Adheres, POPL 2010, Programming Languages, Standard Locking Protocols, Two-phase Locking