Types for deterministic concurrency
Alex Aiken, George C. Necula, Tachio Terauchi · 2006
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.