{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:34Z","timestamp":1772164054126,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K034413\/1, EP\/K011715\/1, EP\/L00058X\/1, EP\/N027833\/1"],"award-info":[{"award-number":["EP\/K034413\/1, EP\/K011715\/1, EP\/L00058X\/1, EP\/N027833\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["612985"],"award-info":[{"award-number":["612985"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1145\/3009837.3009847","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T16:20:29Z","timestamp":1482423629000},"page":"748-761","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Fencing off go: liveness and safety for channel-based programming"],"prefix":"10.1145","author":[{"given":"Julien","family":"Lange","sequence":"first","affiliation":[{"name":"Imperial College London, UK"}]},{"given":"Nicholas","family":"Ng","sequence":"additional","affiliation":[{"name":"Imperial College London, UK"}]},{"given":"Bernardo","family":"Toninho","sequence":"additional","affiliation":[{"name":"Imperial College London, UK"}]},{"given":"Nobuko","family":"Yoshida","sequence":"additional","affiliation":[{"name":"Imperial College London, UK"}]}],"member":"320","published-online":{"date-parts":[[2017,1]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Collection of Golang concurrency patterns. https:\/\/github. com\/stillwater-sc\/concurrency. Collection of Golang concurrency patterns. https:\/\/github. com\/stillwater-sc\/concurrency."},{"key":"e_1_3_2_2_2_1","unstructured":"Tool chain. http:\/\/mrg.doc.ic.ac.uk\/tools\/gong. Tool chain. http:\/\/mrg.doc.ic.ac.uk\/tools\/gong."},{"key":"e_1_3_2_2_3_1","volume-title":"Flywheel: Google\u2019s Data Compression Proxy for the Mobile Web. In NSDI 2015","author":"Agababov V.","year":"2015","unstructured":"V. Agababov , M. Buettner , V. Chudnovsky , M. Cogan , B. Greenstein , S. McDaniel , M. Piatek , C. Scott , M. Welsh , and B. Yin . Flywheel: Google\u2019s Data Compression Proxy for the Mobile Web. In NSDI 2015 , 2015 . V. Agababov, M. Buettner, V. Chudnovsky, M. Cogan, B. Greenstein, S. McDaniel, M. Piatek, C. Scott, M. Welsh, and B. Yin. Flywheel: Google\u2019s Data Compression Proxy for the Mobile Web. In NSDI 2015, 2015."},{"key":"e_1_3_2_2_4_1","volume-title":"Experience with ePaxos: Systems Research using Go","author":"Anderson D. G.","year":"2013","unstructured":"D. G. Anderson . Experience with ePaxos: Systems Research using Go . 2013 . https:\/\/da-data.blogspot.co.uk\/2013\/10\/ experience-with-epaxos-systems-research.html. D. G. Anderson. Experience with ePaxos: Systems Research using Go. 2013. https:\/\/da-data.blogspot.co.uk\/2013\/10\/ experience-with-epaxos-systems-research.html."},{"key":"e_1_3_2_2_5_1","unstructured":"Andrew Gerrand. Share Memory By Communicating. https:\/\/ blog.golang.org\/share-memory-by-communicating. Andrew Gerrand. Share Memory By Communicating. https:\/\/ blog.golang.org\/share-memory-by-communicating."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/322374.322380"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759225"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_28"},{"key":"e_1_3_2_2_9_1","series-title":"LNCS","first-page":"236","volume-title":"CONCUR","author":"Caires L.","unstructured":"L. Caires and F. Pfenning . Session types as intuitionistic linear propositions . In CONCUR , volume 6269 of LNCS , pages 222\u2013 236 . Springer, 2010. L. Caires and F. Pfenning. Session types as intuitionistic linear propositions. In CONCUR, volume 6269 of LNCS, pages 222\u2013236. Springer, 2010."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129514000218"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43376-8_4"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503278"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1772150.1772152"},{"issue":"2","key":"e_1_3_2_2_14_1","first-page":"238","volume":"26","author":"Coppo M.","year":"2016","unstructured":"M. Coppo , M. Dezani-Ciancaglini , N. Yoshida , and L. Padovani . Global Progress for Dynamically Interleaved Multiparty Sessions. MSCS , 26 ( 2 ): 238 \u2013 302 , 2016 . M. Coppo, M. Dezani-Ciancaglini, N. Yoshida, and L. Padovani. Global Progress for Dynamically Interleaved Multiparty Sessions. MSCS, 26(2):238\u2013302, 2016.","journal-title":"Global Progress for Dynamically Interleaved Multiparty Sessions. MSCS"},{"key":"e_1_3_2_2_15_1","volume-title":"Type-checking liveness for collaborative processes with bounded and unbounded recursion. Logical Methods in Computer Science, 12(1)","author":"Debois S.","year":"2016","unstructured":"S. Debois , T. T. Hildebrandt , T. Slaats , and N. Yoshida . Type-checking liveness for collaborative processes with bounded and unbounded recursion. Logical Methods in Computer Science, 12(1) , 2016 . S. Debois, T. T. Hildebrandt, T. Slaats, and N. Yoshida. Type-checking liveness for collaborative processes with bounded and unbounded recursion. Logical Methods in Computer Science, 12(1), 2016."},{"key":"e_1_3_2_2_16_1","volume-title":"go 1.5.1 linux\/amd64 deadlock detection failed","author":"Fitzpatrick B.","year":"2015","unstructured":"B. Fitzpatrick . go 1.5.1 linux\/amd64 deadlock detection failed , 2015 . https:\/\/github.com\/golang\/go\/issues\/12734# issuecomment-142859447. B. Fitzpatrick. go 1.5.1 linux\/amd64 deadlock detection failed, 2015. https:\/\/github.com\/golang\/go\/issues\/12734# issuecomment-142859447."},{"key":"e_1_3_2_2_17_1","series-title":"LNCS","first-page":"77","volume-title":"CONCUR","author":"Giachino E.","unstructured":"E. Giachino , N. Kobayashi , and C. Laneve . Deadlock analysis of unbounded process networks . In CONCUR , volume 8704 of LNCS , pages 63\u2013 77 . Springer, 2014. E. Giachino, N. Kobayashi, and C. Laneve. Deadlock analysis of unbounded process networks. In CONCUR, volume 8704 of LNCS, pages 63\u201377. Springer, 2014."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"C. Hoare. Communicating Sequential Processes. Prentice Hall 1985. C. Hoare. Communicating Sequential Processes. Prentice Hall 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"e_1_3_2_2_19_1","series-title":"LNCS","first-page":"138","volume-title":"ESOP\u201998","author":"Honda K.","unstructured":"K. Honda , V. T. Vasconcelos , and M. Kubo . Language primitives and type disciplines for structured communication-based programming . In ESOP\u201998 , volume 1381 of LNCS , pages 22\u2013 138 . Springer-Verlag, 1998. K. Honda, V. T. Vasconcelos, and M. Kubo. Language primitives and type disciplines for structured communication-based programming. In ESOP\u201998, volume 1381 of LNCS, pages 22\u2013138. Springer-Verlag, 1998."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328472"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2873052"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00325-6"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-005-0179-x"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817949_16"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1745312.1745313"},{"key":"e_1_3_2_2_26_1","volume-title":"Resource usage analysis for the p-calculus. Logical Methods in Computer Science, 2(3)","author":"Kobayashi N.","year":"2006","unstructured":"N. Kobayashi , K. Suenaga , and L. Wischik . Resource usage analysis for the p-calculus. Logical Methods in Computer Science, 2(3) , 2006 . N. Kobayashi, K. Suenaga, and L. Wischik. Resource usage analysis for the p-calculus. Logical Methods in Computer Science, 2(3), 2006."},{"key":"e_1_3_2_2_27_1","unstructured":"J. Lange N. Ng B. Toninho and N. Yoshida. Full version of this paper. Available at https:\/\/arxiv.org\/abs\/1610.08843. J. Lange N. Ng B. Toninho and N. Yoshida. Full version of this paper. Available at https:\/\/arxiv.org\/abs\/1610.08843."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676964"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/539036"},{"key":"e_1_3_2_2_30_1","volume-title":"Communication and Concurrency","author":"Milner R.","year":"1989","unstructured":"R. Milner . Communication and Concurrency . Prentice-Hall, Inc. , Upper Saddle River, NJ, USA, 1989 . R. Milner. Communication and Concurrency. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1989."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"R. Milner and D. Sangiorgi . Barbed bisimulation . In W. Kuich editor ICALP volume 623 of LNCS pages 685\u2013 695 . Springer-Verlag 1992. R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich editor ICALP volume 623 of LNCS pages 685\u2013695. Springer-Verlag 1992.","DOI":"10.1007\/3-540-55719-9_114"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2517350"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2892208.2892232"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.174538"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603116"},{"key":"e_1_3_2_2_36_1","volume-title":"Go Concurrency Patterns","author":"Pike Rob","year":"2012","unstructured":"Rob Pike . Go Concurrency Patterns , 2012 . Rob Pike. Go Concurrency Patterns, 2012."},{"key":"e_1_3_2_2_37_1","unstructured":"https:\/\/talks. golang.org\/2012\/concurrency.slide. https:\/\/talks. golang.org\/2012\/concurrency.slide."},{"key":"e_1_3_2_2_38_1","volume-title":"Advanced Go Concurrency Patterns","author":"Ajamni Sameer","year":"2013","unstructured":"Sameer Ajamni . Advanced Go Concurrency Patterns , 2013 . https: \/\/talk.golang.org\/2013\/advconc.slide. Sameer Ajamni. Advanced Go Concurrency Patterns, 2013. https: \/\/talk.golang.org\/2013\/advconc.slide."},{"key":"e_1_3_2_2_39_1","volume-title":"Go Concurrency Patterns: Pipelines and cancellation","author":"Ajmani Sameer","year":"2014","unstructured":"Sameer Ajmani . Go Concurrency Patterns: Pipelines and cancellation , 2014 . https:\/\/blog.golang.org\/pipelines. Sameer Ajmani. Go Concurrency Patterns: Pipelines and cancellation, 2014. https:\/\/blog.golang.org\/pipelines."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","DOI":"10.1017\/9781316134924","volume-title":"The \u03c0-Calculus: a Theory of Mobile Processes","author":"Sangiorgi D.","year":"2001","unstructured":"D. Sangiorgi and D. Walker . The \u03c0-Calculus: a Theory of Mobile Processes . Cambridge University Press , 2001 . D. Sangiorgi and D. Walker. The \u03c0-Calculus: a Theory of Mobile Processes. Cambridge University Press, 2001."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47958-3_7"},{"key":"e_1_3_2_2_42_1","series-title":"LNCS","first-page":"413","volume-title":"PARLE\u201994","author":"Takeuchi K.","unstructured":"K. Takeuchi , K. Honda , and M. Kubo . An Interaction-based Language and its Typing System . In PARLE\u201994 , volume 817 of LNCS , pages 398\u2013 413 . Springer-Verlag, 1994. K. Takeuchi, K. Honda, and M. Kubo. An Interaction-based Language and its Typing System. In PARLE\u201994, volume 817 of LNCS, pages 398\u2013413. Springer-Verlag, 1994."},{"key":"e_1_3_2_2_43_1","unstructured":"The Go Authors. Effective Go. https:\/\/golang.org\/doc\/ effective_go.html. The Go Authors. Effective Go. https:\/\/golang.org\/doc\/ effective_go.html."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_20"},{"key":"e_1_3_2_2_45_1","first-page":"175","volume-title":"TGC\u201914","author":"Toninho B.","year":"2014","unstructured":"B. Toninho , L. Caires , and F. Pfenning . Corecursion and nondivergence in session-typed processes . In TGC\u201914 , pages 159\u2013 175 , 2014 . B. Toninho, L. Caires, and F. Pfenning. Corecursion and nondivergence in session-typed processes. In TGC\u201914, pages 159\u2013175, 2014."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364568"},{"key":"e_1_3_2_2_47_1","unstructured":"S. Weirich and B. Yorgey. Unbound library. https:\/\/hackage. haskell.org\/package\/unbound. S. Weirich and B. Yorgey. Unbound library. https:\/\/hackage. haskell.org\/package\/unbound."}],"event":{"name":"POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","location":"Paris France","acronym":"POPL '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009847","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009837.3009847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:36:21Z","timestamp":1750203381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009847"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":47,"alternative-id":["10.1145\/3009837.3009847","10.1145\/3009837"],"URL":"https:\/\/doi.org\/10.1145\/3009837.3009847","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093333.3009847","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"2017-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}