Model-Checking of Correctness Conditions for Concurrent Objects

R. Alur, K. L. McMillan, D. Peled

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The notions of serializability, linearizability and sequential consistency are used in the speciffcation 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 shufed using a semi-commutative alphabet. The three model checking problems are shown to be, respectively, in Pspace, in Expspace, and undecidable.
Original languageAmerican English
Title of host publicationthe 11th IEEE Symposium on Logic in Computer Science (LICS 1996)
StatePublished - 1996

Bibliographical note

Place of conference:New Brunswick, NJ, USA


Dive into the research topics of 'Model-Checking of Correctness Conditions for Concurrent Objects'. Together they form a unique fingerprint.

Cite this