Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Concurrent Separation Logic for Pipelined Parallelization
 

Summary: Concurrent Separation Logic
for Pipelined Parallelization
Christian J. Bell, Andrew W. Appel, and David Walker
Princeton University, Computer Science Department,
35 Olden Drive, 08540-5233 Princeton, New Jersey
{cbell,dpw,appel}@cs.princeton.edu
http://www.cs.princeton.edu/
Abstract. Recent innovations in automatic parallelizing compilers are
showing impressive speedups on multicore processors using shared mem-
ory with asynchronous channels. We have formulated an operational se-
mantics and proved sound a concurrent separation logic to reason about
multithreaded programs that communicate asynchronously through chan-
nels and share memory. Our logic supports shared channel endpoints
(multiple producers and consumers) and introduces histories to over-
come limitations with local reasoning. We demonstrate how to transform
a sequential proof into a parallelized proof that targets the output of the
parallelizing optimization DSWP (Decoupled Software Pipelining).
1 Introduction
We have created an operational semantics and a concurrent separation logic
(CSL) to reason about the correctness of programs that share memory and use

  

Source: Appel, Andrew W. - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences