Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01774941
Contributor : Hal Ifip <>
Submitted on : Tuesday, April 24, 2018 - 10:54:10 AM
Last modification on : Tuesday, April 24, 2018 - 11:20:06 AM
Long-term archiving on: : Wednesday, September 19, 2018 - 9:39:03 AM

File

978-3-319-19282-6_6_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Luca Padovani, Tzu-Chun Chen, Andrea Tosatto. Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear π-Calculi. 17th International Conference on Coordination Languages and Models (COORDINATION), Jun 2015, Grenoble, France. pp.83-98, ⟨10.1007/978-3-319-19282-6_6⟩. ⟨hal-01774941⟩

Share

Metrics

Record views

204

Files downloads

372