A Capability Calculus for Concurrency and Determinism

Tachio Terauchi and Alex Aiken

EECS Department, University of California, Berkeley

Technical Report No. UCB/EECS-2006-84

June 7, 2006

This publication is archived. It is kept only for reference purposes, so it is no longer being updated and may not meet accessibility standards. If you need this content in a different format, please email webteam@eecs.berkeley.edu.

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/Archive/EECS-2006-84.pdf

We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be partially confluent than previous approaches, and is able to handle a mix of different kinds of communication channels, including shared reference cells.

BibTeX citation:

@techreport{Terauchi:EECS-2006-84,
    Author= {Terauchi, Tachio and Aiken, Alex},
    Title= {A Capability Calculus for Concurrency and Determinism},
    Year= {2006},
    Month= {Jun},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-84.html},
    Number= {UCB/EECS-2006-84},
    Abstract= {We present a capability calculus for checking partial confluence of channel-communicating concurrent processes.  Our approach automatically detects more programs to be partially confluent than previous approaches, and is able to handle a mix of different kinds of communication channels, including shared reference cells.},
}

EndNote citation:

%0 Report
%A Terauchi, Tachio 
%A Aiken, Alex 
%T A Capability Calculus for Concurrency and Determinism
%I EECS Department, University of California, Berkeley
%D 2006
%8 June 7
%@ UCB/EECS-2006-84
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-84.html
%F Terauchi:EECS-2006-84