Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear π-Calculi - Coordination Models and Languages
Conference Papers Year : 2015

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.

Domains

Computer Science [cs] Networking and Internet Architecture [cs.NI]
Fichier principal
Vignette du fichier
978-3-319-19282-6_6_Chapter.pdf (227.78 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01774941

Submitted on : Tuesday, April 24, 2018-10:54:10 AM

Last modification on : Tuesday, January 9, 2024-12:34:04 PM

Long-term archiving on : Wednesday, September 19, 2018-9:39:03 AM

Download

Dates and versions

hal-01774941 , version 1 (24-04-2018)

Licence

Attribution

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-WG IFIP-TC6 IFIP-WG6-1 IFIP-COORDINATION IFIP-DISCOTEC IFIP-LNCS-9037
164 View
317 Download

Altmetric

Share

More