A capability calculus for concurrency and determinism

Tachio Terauchi*, Alex Aiken

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)


We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be partially confluent than previous approaches and is able to handle a mix of different kinds of communication channels, including shared reference cells.

Original languageEnglish
Title of host publicationCONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540373764, 9783540373766
Publication statusPublished - 2006
Externally publishedYes
Event17th International Conference on Concurrency Theory, CONCUR 2006 - Bonn, Germany
Duration: 2006 Aug 272006 Aug 30

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4137 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other17th International Conference on Concurrency Theory, CONCUR 2006

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


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

Cite this