SPIN as a Linearizability Checker under Weak Memory Models

Oleg Travkin, Annika Mütze, Heike Wehrheim

Abstract: Linearizability is the key correctness criterion for concurrent data structures like stacks, queues or sets. Consequently, much effort has been spent on developing techniques for showing linearizability. However, most of these approaches assume a sequentially consistent memory model whereas today’s multicore processors provide relaxed out-of-order execution semantics.