Model-checking of correctness conditions for concurrent objects

Rajeev Alur, Ken McMillan, Doron Peled

Research output: Contribution to journalConference articlepeer-review

41 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 semi-commutative alphabet. The three model checking problems are shown to be, respectively, in PSPACE, in EXPSPACE, and undecidable.

Original languageEnglish
Pages (from-to)219-228
Number of pages10
JournalProceedings - Symposium on Logic in Computer Science
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 11th Annual IEEE Symposium on Logic in Computer Science, LICS'96 - New Brunswick, NJ, USA
Duration: 27 Jul 199630 Jul 1996


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

Cite this