Skip to main content
Conference Proceedings

A capability calculus for concurrency and determinism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4137 LNCS 218-232
DOI: 10.1007/11817949_15
10Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Terauchi, T., & Aiken, A. (2006). A capability calculus for concurrency and determinism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4137 LNCS, pp. 218–232). Springer Verlag. https://doi.org/10.1007/11817949_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free