{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:34:25Z","timestamp":1770280465778,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T00:00:00Z","timestamp":1641859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,1,17]]},"DOI":"10.1145\/3497775.3503686","type":"proceedings-article","created":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T05:20:48Z","timestamp":1641964848000},"page":"13-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Overcoming restraint: composing verification of foreign functions with cogent"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3530-6662","authenticated-orcid":false,"given":"Louis","family":"Cheung","sequence":"first","affiliation":[{"name":"University of Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2765-4269","authenticated-orcid":false,"given":"Liam","family":"O'Connor","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4785-2836","authenticated-orcid":false,"given":"Christine","family":"Rizkallah","sequence":"additional","affiliation":[{"name":"University of Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSCD.2016.1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872404"},{"key":"e_1_3_2_1_4_1","unstructured":"2021. Cogent FFI Examples (Code and Proofs). https:\/\/github.com\/au-ts\/cogent\/releases\/tag\/cpp2022  2021. Cogent FFI Examples (Code and Proofs). https:\/\/github.com\/au-ts\/cogent\/releases\/tag\/cpp2022"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32347-8_8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594296"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837642"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629596"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITP.2019.22"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-017-9437-1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14052-5_24"},{"key":"e_1_3_2_1_12_1","volume-title":"Recursive Types for Cogent","author":"Murray Emmet","year":"2021","unstructured":"Emmet Murray . 2019. Recursive Types for Cogent . University of New South Wales. https :\/\/github.com\/emmet-m\/thesis Accessed November 2021 . Emmet Murray. 2019. Recursive Types for Cogent. University of New South Wales. https:\/\/github.com\/emmet-m\/thesis Accessed November 2021."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784764"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9"},{"key":"e_1_3_2_1_16_1","unstructured":"Liam O\u2019Connor Zilin Chen Christine Rizkallah Sidney Amani Japheth Lim Toby Murray Yutaka Nagashima Thomas Sewell and Gerwin Klein. 2016.  Liam O\u2019Connor Zilin Chen Christine Rizkallah Sidney Amani Japheth Lim Toby Murray Yutaka Nagashima Thomas Sewell and Gerwin Klein. 2016."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679682100023X"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341689"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51054-1_7"},{"key":"e_1_3_2_1_20_1","volume-title":"Termination Checker for Recursive Types in Cogent","author":"Qiu Lucy","unstructured":"Lucy Qiu . 2020. Termination Checker for Recursive Types in Cogent . University of New South Wales. Lucy Qiu. 2020. Termination Checker for Recursive Types in Cogent. University of New South Wales."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43144-4_20"},{"key":"e_1_3_2_1_22_1","unstructured":"Philip Wadler. 1990. Linear types can change the world!. In Programming Concepts and Methods. North.  Philip Wadler. 1990. Linear types can change the world!. In Programming Concepts and Methods. North."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660201"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_34"}],"event":{"name":"CPP '22: 11th ACM SIGPLAN International Conference on Certified Programs and Proofs","location":"Philadelphia PA USA","acronym":"CPP '22","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3497775.3503686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3497775.3503686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:49:25Z","timestamp":1750193365000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3497775.3503686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,11]]},"references-count":22,"alternative-id":["10.1145\/3497775.3503686","10.1145\/3497775"],"URL":"https:\/\/doi.org\/10.1145\/3497775.3503686","relation":{},"subject":[],"published":{"date-parts":[[2022,1,11]]},"assertion":[{"value":"2022-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}