A Capability Calculus for Concurrency and Determinism

This paper presents a static system for checking determinism (technically, partial confluence) of communicating concurrent processes. The authors' approach automatically detects partial confluence in programs communicating via a mix of different kinds of communication methods: rendezvous channels, buffered channels, broadcast channels, and reference cells. Their system reduces the partial confluence checking problem in polynomial time (in the size of the program) to the problem of solving a system of rational linear inequalities, and is thus efficient.