Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Modelchecking of correctness conditions for concurrent objects \Lambda
 

Summary: Model­checking of correctness conditions for
concurrent objects \Lambda
Rajeev Alur
Bell Labs and UC Berkeley
alur@ic.eecs.berkeley.edu
Ken McMillan
Cadence Berkeley Labs
mcmillan@cadence.com
Doron Peled
Bell Labs
doron@bell­labs.com
Abstract
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.
1 Introduction
A common way of specifying concurrent systems is to describe the desired se­

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

 

Collections: Computer Technologies and Information Sciences