Model-checking of correctness conditions for concurrent objects

Rajeev Alur, Ken McMillan, Doron Peled

Research output: Contribution to journalArticlepeer-review

61 Scopus citations


The notions of serializability, linearizability, and sequential consistency are used in the specification of concurrent systems. We show that the model checking problem for each of these properties can be cast in terms of the containment of one regular language in another regular language shuffled using a semicommutative alphabet. The three model checking problems are shown to be, respectively, in PSPACE, in EXPSPACE, and undecidable.

Original languageEnglish
Pages (from-to)167-188
Number of pages22
JournalInformation and Computation
Issue number1-2
StatePublished - 2000
Externally publishedYes


Dive into the research topics of 'Model-checking of correctness conditions for concurrent objects'. Together they form a unique fingerprint.

Cite this