A capability calculus for concurrency and determinism

Tachio Terauchi*, Alex Aiken

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

22 Citations (Scopus)


This article presents a static system for checking determinism (technically, partial confluence) of communicating concurrent processes. Our 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. Our 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.

Original languageEnglish
Article number27
JournalACM Transactions on Programming Languages and Systems
Issue number5
Publication statusPublished - 2008 Aug 1
Externally publishedYes


  • Capabilities
  • Determinism
  • Type systems

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'A capability calculus for concurrency and determinism'. Together they form a unique fingerprint.

Cite this