Deadlock and lock freedom in the linear π-calculus

Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic, CSL 2014 and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2014

Volumn , Issue , 2014, Pages

  Padovani, Luca ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

Deadlock; Linear calculus; Polymorphism; Types

Indexed keywords

CALCULATIONS; LOCKS (FASTENERS); POLYMORPHISM;

DEADLOCK; DEADLOCK FREEDOM; LOCK FREEDOMS; NEW FORMS; RECURSIVE PROCESS; STABLE STATE; TYPE SYSTEMS; TYPES;

COMPUTATION THEORY;

EID: 84905966254     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2603088.2603116     Document Type: Conference Paper

References (34)

1. L. Bettini, M. Coppo, L. D'Antoni, M. De Luca, M. Dezani-Ciancaglini, and N. Yoshida. Global progress in dynamically interleaved multiparty sessions. In Proceedings of CONCUR'08, LNCS 5201, pages 418-433, 2008.
2. E. Bonelli and A. B. Compagnoni. Multipoint session types for a distributed calculus. In Proceedings of TGC'07, LNCS 4912, pages 240-256. Springer, 2008.
3. E. Bonelli, A. B. Compagnoni, and E. L. Gunter. Correspondence assertions for process synchronization in concurrent communications. Journal of Functional Programming, 15(2):219-247, 2005.
4. V. Bono and L. Padovani. Typing Copyless Message Passing. Logical Methods in Computer Science, 8:1-50, 2012.
5. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323-342, 1983.
6. L. Caires and F. Pfenning. Session types as intuitionistic linear propositions. In Proceedings of CONCUR'10, LNCS 6269, pages 222-236, 2010.
7. G. Castagna, M. Dezani-Ciancaglini, and L. Padovani. On Global Types and Multi-Party Sessions. Logical Methods in Computer Science, 8:1-45, 2012.
8. G. Cécé and A. Finkel. Verification of programs with half-duplex communication. Information and Computation, 202(2):166-190, 2005.
9. M. Coppo, M. Dezani-Ciancaglini, L. Padovani, and N. Yoshida. Inference of Global Progress Properties for Dynamically Interleaved Multiparty Sessions. In Proceedings of COORDINATION'13, LNCS 7890, pages 45-59. Springer, 2013.
10. M. Coppo, M. Dezani-Ciancaglini, N. Yoshida, and L. Padovani. Global progress for dynamically interleaved multiparty sessions. Mathematical Structures in Computer Science, to appear.
11. B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95-169, 1983.
12. O. Dardha, E. Giachino, and D. Sangiorgi. Session types revisited. In Proceedings of PPDP'12, pages 139-150. ACM, 2012.
13. R. Demangeon and K. Honda. Nested protocols in session types. In Proceedings of CONCUR'12, LNCS 7454, pages 272-286. Springer, 2012.
14. Y. Deng and D. Sangiorgi. Ensuring termination by typability. Information and Computation, 204(7):1045-1082, 2006.
15. P.-M. Deniélou and N. Yoshida. Multiparty session types meet communicating automata. In Proceedings of ESOP'12, LNCS 7211, pages 194-213. Springer, 2012.
16. P.-M. Deniélou, N. Yoshida, A. Bejleri, and R. Hu. Parameterised multiparty session types. Logical Methods in Computer Science, 8(4), 2012.
17. K. Honda. Types for dyadic interaction. In Proceedings of CONCUR' 93, LNCS 715, pages 509-523. Springer, 1993.
18. K. Honda, V. T. Vasconcelos, and M. Kubo. Language primitives and type disciplines for structured communication-based programming. In Proceedings of ESOP'98, LNCS 1381, pages 122-138. Springer, 1998.
19. K. Honda, N. Yoshida, and M. Carbone. Multiparty asynchronous session types. In Proceedings of POPL'08, pages 273-284. ACM, 2008.
20. A. Igarashi and N. Kobayashi. Type reconstruction for linear-calculus with i/o subtyping. Information and Computation, 161(1):1-44, 2000.
21. S. JakŜic and L. Padovani. Exception Handling for Copyless Messaging. Science of Computer Programming, 84:22-51, 2014.
22. N. Kobayashi. A type system for lock-free processes. Information and Computation, 177(2):122-159, 2002.
23. N. Kobayashi. Type-based information flow analysis for the picalculus. Acta Informatica, 42(4-5):291-347, 2005.
24. N. Kobayashi. A new type system for deadlock-free processes. In Proceedings of CONCUR'06, LNCS 4137, pages 233-247. Springer, 2006.
25. N. Kobayashi. Type systems for concurrent programs. Technical report, Tohoku University, 2007. Short version appeared in 10th Anniversary Colloquium of UNU/IIST, 2002.
26. N. Kobayashi and D. Sangiorgi. A hybrid type system for lockfreedom of mobile processes. ACM Transactions on Programming Languages and Systems, 32(5), 2010.
27. N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the picalculus. ACM Transactions on Programming Languages and Systems, 21(5):914-947, 1999.
28. F. Montesi and N. Yoshida. Compositional choreographies. In Proceedings of CONCUR'13, LNCS 8052, pages 425-439. Springer, 2013.
29. L. Padovani. From Lock Freedom to Progress Using Session Types. In Proceedings of PLACES'13, EPTCS 137, pages 3-19, 2013.
30. L. Padovani. Type reconstruction for the linear-calculus with composite and equi-recursive types. In Proceedings of FoSSaCS'14, LNCS 8412, pages 88-102. Springer, 2014.
31. L. Padovani. Deadlock and lock freedom in the linear-calculus. Technical report, Università di Torino, 2014. Available at http: //hal.inria.fr/hal-00932356/.
32. L. Padovani and L. Novara. Types for deadlock-free higher-order concurrent programs. Technical report, Università di Torino, 2014. Available at http://hal.inria.fr/hal-00954364/.
33. H. T. Vieira and V. T. Vasconcelos. Typing progress in communication-centred systems. In Proceedings of COORDINATION' 13, LNCS 7890, pages 236-250. Springer, 2013.
34. P.Wadler. Propositions as sessions. In Proceedings of ICFP'12, pages 273-286. ACM, 2012