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 automatically verify partial correctness of concurrent FIFO queue algorithms using existing abstract interpretation techniques. In particular, we verify all the safety properties originally specified for two concurrent queue algorithms without imposing an a priori bound on the number of allocated objects and threads.
|Number of pages||14|
|Journal||Electronic Notes in Theoretical Computer Science|
|State||Published - Sep 2003|
|Event||SoftMC 2003, Workshop on Software Model Checking (Satellite Workshop of CAV '03) - Ottawa, Canada|
Duration: 26 Jun 2003 → 27 Jun 2003