Model-Checking of Correctness Conditions for Concurrent Objects

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

Model-Checking of Correctness Conditions for Concurrent Objects

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 language	American English
Title of host publication	the 11th IEEE Symposium on Logic in Computer Science (LICS 1996)
Publisher	IEEE
State	Published - 1996

Bibliographical note

Place of conference:New Brunswick, NJ, USA

Cite this

@inproceedings{55801f042eaa44ce8bc71dc8acc85153,

title = "Model-Checking of Correctness Conditions for Concurrent Objects",

abstract = "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.",

author = "R. Alur and McMillan, \{K. L.\} and D. Peled",

note = "Place of conference:New Brunswick, NJ, USA",

year = "1996",

language = "American English",

booktitle = "the 11th IEEE Symposium on Logic in Computer Science (LICS 1996)",

publisher = "IEEE",

}

TY - GEN

T1 - Model-Checking of Correctness Conditions for Concurrent Objects

AU - Alur, R.

AU - McMillan, K. L.

AU - Peled, D.

N1 - Place of conference:New Brunswick, NJ, USA

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - https://www.semanticscholar.org/paper/Model-Checking-of-Correctness-Conditions-for-Alur-McMillan/80e1df595a00f2087bc50366b67bfc2554e955e8/pdf

M3 - Conference contribution

BT - the 11th IEEE Symposium on Logic in Computer Science (LICS 1996)

PB - IEEE

ER -

Model-Checking of Correctness Conditions for Concurrent Objects

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this