A capability calculus for concurrency and determinism

Tachio Terauchi, Alex Aiken

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

9 Citations (Scopus)

Abstract

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
Pages218-232
Number of pages15
ISBN (Print)3540373764, 9783540373766
Publication statusPublished - 2006 Jan 1
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

Other

Other17th International Conference on Concurrency Theory, CONCUR 2006
CountryGermany
CityBonn
Period06/8/2706/8/30

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

  • Cite this

    Terauchi, T., & Aiken, A. (2006). A capability calculus for concurrency and determinism. In CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings (pp. 218-232). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4137 LNCS). Springer Verlag.