{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T19:10:37Z","timestamp":1763233837851,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2018R1C1B5046826"],"award-info":[{"award-number":["2018R1C1B5046826"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE2014-T2-2-076"],"award-info":[{"award-number":["MOE2014-T2-2-076"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209125","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T12:14:43Z","timestamp":1530101683000},"page":"26-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Quasi-Open Bisimilarity with Mismatch is Intuitionistic"],"prefix":"10.1145","author":[{"given":"Ross","family":"Horne","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Nanyang Technological University, Singapore"}]},{"given":"Ki Yung","family":"Ahn","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Hannam University, Daejeon, Korea"}]},{"given":"Shang-wei","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanyang Technological University, Singapore"}]},{"given":"Alwen","family":"Tiu","sequence":"additional","affiliation":[{"name":"Research School of Computer Science, Australian National University, Canberra"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3127586"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.12.023"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. CONCUR 2017 (LIPIcs)","volume":"85","author":"Ahn Ki Yung","year":"2017","unstructured":"Ki Yung Ahn , Ross Horne , and Alwen Tiu . 2017 . A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic . In Proc. CONCUR 2017 (LIPIcs) , Vol. 85 . 7:1--7:17. Ki Yung Ahn, Ross Horne, and Alwen Tiu. 2017. A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic. In Proc. CONCUR 2017 (LIPIcs), Vol. 85. 7:1--7:17."},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"Abella: A System for Reasoning about Relational Specifications","volume":"7","author":"Baelde David","year":"2014","unstructured":"David Baelde , Kaustuv Chaudhuri , Andrew Gacek , Dale Miller , Gopalan Nadathur , Alwen Tiu , and Yuting Wang . 2014 . Abella: A System for Reasoning about Relational Specifications . J. Formalized Reasoning 7 , 2 (2014), 1 -- 89 . David Baelde, Kaustuv Chaudhuri, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu, and Yuting Wang. 2014. Abella: A System for Reasoning about Relational Specifications. J. Formalized Reasoning 7, 2 (2014), 1--89.","journal-title":"J. Formalized Reasoning"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.05.004"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2011.27"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.041"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00202-0"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2460"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.30"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2012.01.001"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094622.1094628"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90156-N"},{"volume-title":"Barbed bisimulation","author":"Milner Robin","key":"e_1_3_2_1_14_1","unstructured":"Robin Milner and Davide Sangiorgi . 1992. Barbed bisimulation . Springer , Berlin, Heidelberg , 685--695. Robin Milner and Davide Sangiorgi. 1992. Barbed bisimulation. Springer, Berlin, Heidelberg, 685--695."},{"key":"e_1_3_2_1_15_1","volume-title":"Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta informaticae 16, 2","author":"Montanari Ugo","year":"1992","unstructured":"Ugo Montanari and Vladimiro Sassone . 1992. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta informaticae 16, 2 ( 1992 ), 171--199. Ugo Montanari and Vladimiro Sassone. 1992. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta informaticae 16, 2 (1992), 171--199."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1108"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/788020.788899"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050036"},{"volume-title":"On Barbed Equivalences in π-Calculus","author":"Sangiorgi Davide","key":"e_1_3_2_1_19_1","unstructured":"Davide Sangiorgi and David Walker . 2001. On Barbed Equivalences in π-Calculus . Springer , Berlin, Heidelberg , 292--304. Davide Sangiorgi and David Walker. 2001. On Barbed Equivalences in π-Calculus. Springer, Berlin, Heidelberg, 292--304."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656242.1656248"}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"Oxford United Kingdom","acronym":"LICS '18"},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209125","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:07Z","timestamp":1750212427000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":20,"alternative-id":["10.1145\/3209108.3209125","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209125","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}