Abstract : We define complete type reconstruction algorithms for two type sys-tems 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, multi-party sessions as well. A Haskell implementation of the algorithms is available.
