Proving linearizability with temporal logic

Simon Bäumler (1) , Gerhard Schellhorn (1) , Bogdan Tofan (1) , Wolfgang Reif (1)

1 Lehrstuhl für Softwaretechnik und Programmiersprachen

Linearizability is a global correctness criterion for concurrent systems. One technique to prove linearizability is applying a composition theorem which reduces the proof of a property of the overall system to sufficient rely-guarantee conditions for single processes. In this paper, we describe how the temporal logic framework implemented in the KIV interactive theorem prover can be used to model concurrent systems and to prove such a composition theorem. Finally, we show how this generic theorem can be instantiated to prove linearizability of two classic lock-free implementations: a Treiber-like stack and a slightly improved version of Michael and Scott's queue.

Mots clés: Lock-free; Linearizability; Verification; Temporal logic; Compositional reasoning; Rely-guarantee

Simon Bäumler, Gerhard Schellhorn, Bogdan Tofan, Wolfgang Reif. Proving linearizability with temporal logic. Formal Aspects of Computing, 2009, 23 (1), pp.91-112. ⟨10.1007/s00165-009-0130-y⟩. ⟨hal-00554979⟩