{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:17:41Z","timestamp":1748405861656,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319192819"},{"type":"electronic","value":"9783319192826"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19282-6_6","type":"book-chapter","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T11:05:56Z","timestamp":1430305556000},"page":"83-98","source":"Crossref","is-referenced-by-count":1,"title":["Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear \u03c0-Calculi"],"prefix":"10.1007","author":[{"given":"Luca","family":"Padovani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzu-Chun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Tosatto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Amtoft, T., Nielson, F., Nielson, H.: Type and effect systems: behaviours for concurrency. Imperial College Press (1999)","DOI":"10.1142\/9781848160514"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1017\/S0956796897002700","volume":"7","author":"T. Amtoft","year":"1997","unstructured":"Amtoft, T., Nielson, F., Nielson, H.R.: Type and behaviour reconstruction for higher-order concurrent programs. J. Funct. Program.\u00a07(3), 321\u2013347 (1997)","journal-title":"J. Funct. Program."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-38493-6_4","volume-title":"Coordination Models and Languages","author":"M. Coppo","year":"2013","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Padovani, L., Yoshida, N.: Inference of global progress properties for dynamically interleaved multiparty sessions. In: De Nicola, R., Julien, C. (eds.) COORDINATION 2013. LNCS, vol.\u00a07890, pp. 45\u201359. Springer, Heidelberg (2013)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theor. Comp. Sci.\u00a025, 95\u2013169 (1983)","journal-title":"Theor. Comp. Sci."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Dardha, O., Giachino, E., Sangiorgi, D.: Session types revisited. In: PPDP 2012, pp. 139\u2013150. ACM (2012)","DOI":"10.1145\/2370776.2370794"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-28869-2_10","volume-title":"Programming Languages and Systems","author":"P.-M. Deni\u00e9lou","year":"2012","unstructured":"Deni\u00e9lou, P.-M., Yoshida, N.: Multiparty session types meet communicating automata. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol.\u00a07211, pp. 194\u2013213. Springer, Heidelberg (2012)"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/169701.169692","volume":"15","author":"F. Henglein","year":"1993","unstructured":"Henglein, F.: Type inference with polymorphic recursion. ACM Trans. Program. Lang. Syst.\u00a015(2), 253\u2013289 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: POPL 2008, pp. 273\u2013284. ACM (2008)","DOI":"10.1145\/1328897.1328472"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2000.2872","volume":"161","author":"A. Igarashi","year":"2000","unstructured":"Igarashi, A., Kobayashi, N.: Type reconstruction for linear \u03c0-calculus with I\/O subtyping. Inf. and Comp.\u00a0161(1), 1\u201344 (2000)","journal-title":"Inf. and Comp."},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/169701.169687","volume":"15","author":"A.J. Kfoury","year":"1993","unstructured":"Kfoury, A.J., Tiuryn, J., Urzyczyn, P.: Type reconstruction in the presence of polymorphic recursion. ACM Trans. Program. Lang. Syst.\u00a015(2), 290\u2013311 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0890-5401(02)93171-8","volume":"177","author":"N. Kobayashi","year":"2002","unstructured":"Kobayashi, N.: A type system for lock-free processes. Inf. and Comp.\u00a0177(2), 122\u2013159 (2002)","journal-title":"Inf. and Comp."},{"issue":"4-5","key":"6_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00236-005-0179-x","volume":"42","author":"N. Kobayashi","year":"2005","unstructured":"Kobayashi, N.: Type-based information flow analysis for the pi-calculus. Acta Informatica\u00a042(4-5), 291\u2013347 (2005)","journal-title":"Acta Informatica"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11817949_16","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"N. Kobayashi","year":"2006","unstructured":"Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 233\u2013247. Springer, Heidelberg (2006)"},{"issue":"5","key":"6_CR14","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1145\/330249.330251","volume":"21","author":"N. Kobayashi","year":"1999","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. ACM Trans. Program. Lang. Syst.\u00a021(5), 914\u2013947 (1999)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-32940-1_17","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"J. Lange","year":"2012","unstructured":"Lange, J., Tuosto, E.: Synthesising choreographies from local session types. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 225\u2013239. Springer, Heidelberg (2012)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Lange, J., Tuosto, E., Yoshida, N.: From communicating machines to graphical choreographies. In: POPL 2015, pp. 221\u2013232. ACM (2015)","DOI":"10.1145\/2775051.2676964"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-68265-3_14","volume-title":"Coordination Models and Languages","author":"L.G. Mezzina","year":"2008","unstructured":"Mezzina, L.G.: How to infer finite session types in a calculus of services and sessions. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol.\u00a05052, pp. 216\u2013231. Springer, Heidelberg (2008)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Padovani, L.: Deadlock and lock freedom in the linear \u03c0-calculus. In: CSL-LICS 2014, pp. 72:1\u201372:10. ACM (2014), http:\/\/hal.archives-ouvertes.fr\/hal-00932356v2\/","DOI":"10.1145\/2603088.2603116"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-54830-7_6","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Padovani","year":"2014","unstructured":"Padovani, L.: Type reconstruction for the linear \u03c0-calculus with composite and equi-recursive types. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol.\u00a08412, pp. 88\u2013102. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19282-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T17:25:31Z","timestamp":1748366731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19282-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319192819","9783319192826"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19282-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}