Control Flow Analysis for the Join Calculus

Abstract. Since first being described, the Join Calculus has been incor-porated into a variety of languages as an alternative concurrency primi-tive. While there has been some work on efficient library implementation of the calculus, there has been little on statically analysing and trans-forming it. This work explores adapting conventional analysis techniques to the Join Calculus. In particular, we present three variations of con-trol flow analysis for a flattened version, and consider two important optimisations: inlining and queue bounding