A capability calculus for concurrency and determinism

Tachio Terauchi*, Alex Aiken

*この研究の対応する著者

研究成果: Article査読

22 被引用数 (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.

本文言語English
論文番号27
ジャーナルACM Transactions on Programming Languages and Systems
30
5
DOI
出版ステータスPublished - 2008 8 1
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア

フィンガープリント

「A capability calculus for concurrency and determinism」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル