{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:44:24Z","timestamp":1780994664438,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1521523, 1715154, 1763399"],"award-info":[{"award-number":["1521523, 1715154, 1763399"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394799","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"633-647","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Refinement-Based Game Semantics for Certified Abstraction Layers"],"prefix":"10.1145","author":[{"given":"J\u00e9r\u00e9mie","family":"Koenig","sequence":"first","affiliation":[{"name":"Yale University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhong","family":"Shao","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Reflections on the Work of C","author":"Abramsky Samson"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Samson Abramsky Radha Jagadeesan and Pasquale Malacaria. 2000. Full abstraction for PCF. Information and computation 163 2 (2000) 409--470.  Samson Abramsky Radha Jagadeesan and Pasquale Malacaria. 2000. Full abstraction for PCF. Information and computation 163 2 (2000) 409--470.","DOI":"10.1006\/inco.2000.2930"},{"key":"e_1_3_2_1_3_1","volume-title":"Algol-like languages","author":"Abramsky Samson"},{"key":"e_1_3_2_1_4_1","volume-title":"Computational logic: Proceedings of the 1997 Marktoberdorf Summer School","author":"Abramsky Samson"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1999.782638"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","volume-title":"Theory and Practice: Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday","author":"Alfaro Luca De"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585270"},{"key":"e_1_3_2_1_8_1","volume-title":"CONCUR'98 Concurrency Theory, Davide Sangiorgi and Robert de Simone (Eds.). Springer Berlin Heidelberg","author":"Alur Rajeev"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987211.1987212"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2016.0331"},{"key":"e_1_3_2_1_11_1","unstructured":"Ralph-Johan Back. 1978. On the correctness of refinement steps in program development. Ph.D. Dissertation. Department of Computer Science University of Helsinky Helsinki Finland.  Ralph-Johan Back. 1978. On the correctness of refinement steps in program development. Ph.D. Dissertation. Department of Computer Science University of Helsinky Helsinki Finland."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1674-2"},{"key":"e_1_3_2_1_13_1","volume-title":"New structures for physics","author":"Baez John"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(92)90059-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89366-2_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815402"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/503271.503226"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45449-7_11"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.04.030"},{"key":"e_1_3_2_1_20_1","volume-title":"Programming Methodology","author":"Dijkstra Edsger W"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Dan R. Ghica and Andrzej S. Murawski. 2004. Angelic Semantics of Fine-Grained Concurrency. In Foundations of Software Science and Computation Structures Igor Walukiewicz (Ed.). Springer Berlin Heidelberg Berlin Heidelberg 211--225.  Dan R. Ghica and Andrzej S. Murawski. 2004. Angelic Semantics of Fine-Grained Concurrency. In Foundations of Software Science and Computation Structures Igor Walukiewicz (Ed.). Springer Berlin Heidelberg Berlin Heidelberg 211--225.","DOI":"10.1007\/978-3-540-24727-2_16"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676975"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation","author":"Gu Ronghui","year":"2016"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192381"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1999.782637"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629596"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1997.614931"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538814"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35182-2_27"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.01.007"},{"key":"e_1_3_2_1_33_1","volume-title":"Asynchronous Games: Innocence Without Alternation. In CONCUR 2007 - Concurrency Theory, Lu\u00eds Caires and Vasco T. Vasconcelos (Eds.). Springer Berlin Heidelberg","author":"Melli\u00e8s Paul-Andr\u00e9","year":"2007"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/44501.44503"},{"key":"e_1_3_2_1_35_1","volume-title":"Mathematics of Program Construction","author":"Morris Joseph M."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391956.1391961"},{"key":"e_1_3_2_1_37_1","volume-title":"Reachability Games and Game Semantics: Comparing Nondeterministic Programs. In 2008 23rd Annual IEEE Symposium on Logic in Computer Science. 353--363","author":"Murawski A. S.","year":"2008"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Sumit Nain and Moshe Y. Vardi. 2007. Branching vs. Linear Time: Semantical Perspective. In Automated Technology for Verification and Analysis Kedar S. Namjoshi Tomohiro Yoneda Teruo Higashino and Yoshio Okamura (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 19--34.  Sumit Nain and Moshe Y. Vardi. 2007. Branching vs. Linear Time: Semantical Perspective. In Automated Technology for Verification and Analysis Kedar S. Namjoshi Tomohiro Yoneda Teruo Higashino and Yoshio Okamura (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 19--34.","DOI":"10.1007\/978-3-540-75596-8_4"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.12"},{"key":"e_1_3_2_1_40_1","volume-title":"Foundations of Software Science and Computation Structures","author":"Plotkin Gordon"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_7"},{"key":"e_1_3_2_1_42_1","volume-title":"Theory and Applications of Relational Structures as Knowledge Instruments","author":"Rewitzky Ingrid"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1859204.1859226"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.30"},{"key":"e_1_3_2_1_45_1","volume-title":"Theoretical Aspects of Computing -ICTAC","author":"Tyrrell Malcolm","year":"2006"},{"key":"e_1_3_2_1_46_1","volume-title":"Proceedings of the ACM on Programming Languages 4, POPL","author":"Zakowski Yannick","year":"2019"}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Saarbr\u00fccken Germany","acronym":"LICS '20","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"]},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394799","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:36Z","timestamp":1750197756000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":46,"alternative-id":["10.1145\/3373718.3394799","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394799","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}