Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear π-Calculi
Abstract
We define complete type reconstruction algorithms for two type systems ensuring deadlock and lock freedom of linear π-calculus processes. Our work automates the verification of deadlock/lock freedom for a non-trivial class of processes that includes interleaved binary sessions and, to great extent, multiparty sessions as well. A Haskell implementation of the algorithms is available.
Origin | Files produced by the author(s) |
---|
Loading...