%0 Conference Proceedings
%T Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear π-Calculi
%+ Università degli studi di Torino = University of Turin (UNITO)
%+ Technische Universität Darmstadt - Technical University of Darmstadt (TU Darmstadt)
%A Padovani, Luca
%A Chen, Tzu-Chun
%A Tosatto, Andrea
%Z Part 2: Coordinating Ensembles
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 17th International Conference on Coordination Languages and Models (COORDINATION)
%C Grenoble, France
%Y Tom Holvoet
%Y Mirko Viroli
%I Springer International Publishing
%3 Coordination Models and Languages
%V LNCS-9037
%P 83-98
%8 2015-06-02
%D 2015
%R 10.1007/978-3-319-19282-6_6
%K Type System
%K Integer Variable
%K Simple Type
%K Side Condition
%K Type Expression
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01774941/document
%2 https://inria.hal.science/hal-01774941/file/978-3-319-19282-6_6_Chapter.pdf
%L hal-01774941
%U https://inria.hal.science/hal-01774941
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-COORDINATION
%~ IFIP-DISCOTEC
%~ IFIP-LNCS-9037