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.
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