{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:32:36Z","timestamp":1730280756341,"version":"3.28.0"},"reference-count":27,"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.9470691","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":1,"title":["Verifying higher-order concurrency with data automata"],"prefix":"10.1109","author":[{"given":"Alex","family":"Dixon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranko","family":"Lazic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej S.","family":"Murawski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3371094"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.003"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74456-6_66"},{"key":"ref13","first-page":"27:1","article-title":"Two-variable logic on data words","volume":"12","author":"boja?czyk","year":"2011","journal-title":"ACM Trans Comput Log"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.10.009"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44584-6_34"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15579-1_14"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46678-0_16"},{"key":"ref18","first-page":"313","article-title":"Saturation of concurrent collapsible pushdown systems","volume":"24","author":"hague","year":"2013","journal-title":"Proceedings of FSTTCS"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_24"},{"article-title":"Leafy automata for higher-order concurrency","year":"0","author":"dixon","key":"ref4"},{"key":"ref27","first-page":"29","article-title":"Sequentiality and the picalculus","volume":"2044","author":"berger","year":"2001","journal-title":"Proceedings of TLCA"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/349214.349241"},{"key":"ref6","first-page":"457","article-title":"Parameterised pushdown systems with non-atomic writes","author":"hague","year":"2011","journal-title":"Proceedings of FSTTCS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146681"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2842603"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2160910.2160915"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.032"},{"key":"ref9","first-page":"72","article-title":"Safety of parametrized asynchronous shared-memory systems is almost always decidable","volume":"42","author":"torre","year":"2015","journal-title":"Proceedings of CONCUR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2007.10.005"},{"key":"ref20","first-page":"345","article-title":"The essence of Algol","author":"reynolds","year":"1978","journal-title":"Algorithmic Languages"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_35"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.08.025"},{"key":"ref23","article-title":"Games and strategies as event structures","volume":"13","author":"castellan","year":"2017","journal-title":"Log Meth Comput Sci"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005112"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.63"}],"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\/09470691.pdf?arnumber=9470691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T11:46:20Z","timestamp":1652183180000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470691\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470691","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}