Automatically verifying concurrent queue algorithms

Concurrent FIFO queues are a common component of concurrent systems. Using a single shared lock to prevent concurrent manipulations of queue contents reduces system concurrency. Therefore, many algorithms were suggested to increase concurrency while maintaining the correctness of queue manipulations. This paper shows how to automati-interpretation techniques. In particular, we verify all the safety properties originally speci-fied for two concurrent queue algorithms without imposing an a priori bound on the number of allocated objects and threads.