Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
 

Summary: Bounded Model Checking of Concurrent Data Types on
Relaxed Memory Models: A Case Study
Sebastian Burckhardt, Rajeev Alur, and Milo M.K. Martin
Department of Computer Science
University of Pennsylvania
{sburckha, alur, milom}@cis.upenn.edu
Abstract. Many multithreaded programs employ concurrent data types to safely
share data among threads. However, highly-concurrent algorithms for even seem-
ingly simple data types are difficult to implement correctly, especially when con-
sidering the relaxed memory ordering models commonly employed by today's
multiprocessors. The formal verification of such implementations is challeng-
ing as well because the high degree of concurrency leads to a large number of
possible executions. In this case study, we develop a SAT-based bounded ver-
ification method and apply it to a representative example, a well-known two-
lock concurrent queue algorithm. We first formulate a correctness criterion that
specifically targets failures caused by concurrency; it demands that all concurrent
executions be observationally equivalent to some serial execution. Next, we de-
fine a relaxed memory model that conservatively approximates several common
shared-memory multiprocessors. Using commit point specifications, a suite of
finite symbolic tests, a prototype encoder, and a standard SAT solver, we success-

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania
Martin, Milo M. K. - Department of Computer and Information Science, University of Pennsylvania

 

Collections: Computer Technologies and Information Sciences