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.
Type de document :
Communication dans un congrès
Tom Holvoet; Mirko Viroli. 17th International Conference on Coordination Languages and Models (COORDINATION), Jun 2015, Grenoble, France. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9037, pp.83-98, 2015, Coordination Models and Languages. 〈10.1007/978-3-319-19282-6_6〉
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01774941
Contributeur : Hal Ifip <>
Soumis le : mardi 24 avril 2018 - 10:54:10
Dernière modification le : mardi 24 avril 2018 - 11:20:06

Fichier

978-3-319-19282-6_6_Chapter.pd...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Luca Padovani, Tzu-Chun Chen, Andrea Tosatto. Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear π-Calculi. Tom Holvoet; Mirko Viroli. 17th International Conference on Coordination Languages and Models (COORDINATION), Jun 2015, Grenoble, France. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9037, pp.83-98, 2015, Coordination Models and Languages. 〈10.1007/978-3-319-19282-6_6〉. 〈hal-01774941〉

Partager

Métriques

Consultations de la notice

48

Téléchargements de fichiers

14