Types for Deterministic Concurrency
Tachio Terauchi
EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2006-106
August 16, 2006
http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-106.pdf
This thesis describes a method for ensuring partial determinism in concurrent programs. The idea is presented in two settings: sequential processes communicating via channels and shared references and functional programming with references.
Advisor: Alexander Aiken
BibTeX citation:
@phdthesis{Terauchi:EECS-2006-106,
Author = {Terauchi, Tachio},
Title = {Types for Deterministic Concurrency},
School = {EECS Department, University of California, Berkeley},
Year = {2006},
Month = {Aug},
URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-106.html},
Number = {UCB/EECS-2006-106},
Abstract = {This thesis describes a method for ensuring partial determinism in concurrent programs. The idea is presented in two settings: sequential processes communicating via channels and shared references and functional programming with references.}
}
EndNote citation:
%0 Thesis %A Terauchi, Tachio %T Types for Deterministic Concurrency %I EECS Department, University of California, Berkeley %D 2006 %8 August 16 %@ UCB/EECS-2006-106 %U http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-106.html %F Terauchi:EECS-2006-106