{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:06Z","timestamp":1760203026243,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470531","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T16:14:07Z","timestamp":1625674447000},"page":"1-13","source":"Crossref","is-referenced-by-count":13,"title":["Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom"],"prefix":"10.1109","author":[{"given":"Rob van","family":"Glabbeek","sequence":"first","affiliation":[]},{"given":"Peter","family":"Hofner","sequence":"additional","affiliation":[]},{"given":"Ross","family":"Horne","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32940-1_17"},{"key":"ref32","article-title":"Precise subtyping for asynchronous multiparty sessions","volume":"5","author":"ghilezan","year":"0"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43376-8_4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43376-8_10"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/S096012951400022X"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_18"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01872848"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2827695"},{"key":"ref12","first-page":"328","article-title":"Session types for object-oriented languages","author":"dezani-ciancaglini","year":"0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11580850_16"},{"key":"ref14","first-page":"203","article-title":"Guaranteeing liveness in an object calculus through behavioural typing","author":"najm","year":"0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8528-6_6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129514000188"},{"article-title":"Assuming just enough fairness to make session types complete for lock-freedom","year":"0","author":"horne","key":"ref17"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0890-5401(87)90013-7","article-title":"Weak and strong fairness in CCS","volume":"73","author":"costa","year":"1987","journal-title":"Information and Computation"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2018.12.002"},{"key":"ref4","first-page":"138","article-title":"CCS without ?’s","author":"de nicola","year":"0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2020.100620"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/828.833"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0890-5401(02)93171-8","article-title":"A type system for lock-free processes","volume":"177","author":"kobayashi","year":"2002","journal-title":"Inf Comput"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.tcs.2019.09.027","article-title":"Global types with internal delegation","volume":"807","author":"castellani","year":"2020","journal-title":"Theoretical Computer Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603116"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2019-1863"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-019-00332-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3329125"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44914-8_10"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357178"},{"article-title":"Coinductive validity","year":"0","author":"van glabbeek","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(4:6)2012"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36987-3_5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23217-6_19"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-005-0177-z"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676964"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3290343"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2021,6,29]]},"location":"Rome, Italy","end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470531.pdf?arnumber=9470531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T11:46:21Z","timestamp":1652183181000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470531\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470531","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}