Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the Verification Problem for Weak Memory Models Mohamed Faouzi Atig Ahmed Bouajjani
 

Summary: On the Verification Problem for Weak Memory Models
Mohamed Faouzi Atig Ahmed Bouajjani
LIAFA, University Paris Diderot, Paris, France
{atig,abou}@liafa.jussieu.fr
Sebastian Burckhardt Madanlal Musuvathi
Microsoft Research, Redmond, WA, USA
{sburckha,mandanm}@microsoft.com
Abstract
We address the verification problem of finite-state concurrent pro-
grams running under weak memory models. These models capture
the reordering of program (read and write) operations done by mod-
ern multi-processor architectures for performance. The verification
problem we study is crucial for the correctness of concurrency li-
braries and other performance-critical system services employing
lock-free synchronization, as well as for the correctness of compiler
backends that generate code targeted to run on such architectures.
We consider in this paper combinations of three well-known
program order relaxations. We consider first the "write to read"
relaxation, which corresponds to the TSO (Total Store Ordering)
model. This relaxation is used in most hardware architectures avail-

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences