Automatically verifying concurrent queue algorithms

Eran Yahav, Mooly Sagiv

Research output: Contribution to journalConference articlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)450-463
Number of pages14
JournalElectronic Notes in Theoretical Computer Science
Volume89
Issue number3
DOIs
StatePublished - Sep 2003
EventSoftMC 2003, Workshop on Software Model Checking (Satellite Workshop of CAV '03) - Ottawa, Canada
Duration: 26 Jun 200327 Jun 2003

Fingerprint

Dive into the research topics of 'Automatically verifying concurrent queue algorithms'. Together they form a unique fingerprint.

Cite this