{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:29:30Z","timestamp":1766449770936,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,17]],"date-time":"2021-01-17T00:00:00Z","timestamp":1610841600000},"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":[[2021,1,17]]},"DOI":"10.1145\/3437992.3439924","type":"proceedings-article","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T23:11:11Z","timestamp":1611184271000},"page":"122-136","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Formal verification of authenticated, append-only skip lists in Agda"],"prefix":"10.1145","author":[{"given":"Victor","family":"Cacciari Miraldo","sequence":"first","affiliation":[{"name":"Dfinity Foundation, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harold","family":"Carr","sequence":"additional","affiliation":[{"name":"Oracle Labs, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Moir","sequence":"additional","affiliation":[{"name":"Oracle Labs, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisandra","family":"Silva","sequence":"additional","affiliation":[{"name":"INESC TEC, Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy L.","family":"Steele Jr.","sequence":"additional","affiliation":[{"name":"Oracle Labs, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Formally (Leibniz International Proceedings in Informatics","volume":"141","author":"Matthias","year":"2019"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_10"},{"key":"e_1_3_2_1_4_1","unstructured":"Kiran Gopinathan and Ilya Sergey. 2019. Towards mechanising probabilistic properties of a blockchain. htps:\/\/popl19.sigplan.org\/details\/ CoqPL-2019\/2  Kiran Gopinathan and Ilya Sergey. 2019. Towards mechanising probabilistic properties of a blockchain. htps:\/\/popl19.sigplan.org\/details\/ CoqPL-2019\/2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/788021.788962"},{"key":"e_1_3_2_1_6_1","unstructured":"Petros Maniatis and Mary Baker. 2003. Authenticated Append-only Skip Lists. CoRR cs. CR\/0302010 ( 2003 ). htp:\/\/arxiv.org\/abs\/cs. CR\/ 0302010  Petros Maniatis and Mary Baker. 2003. Authenticated Append-only Skip Lists. CoRR cs. CR\/0302010 ( 2003 ). htp:\/\/arxiv.org\/abs\/cs. CR\/ 0302010"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004829"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48184-2_32"},{"volume-title":"Generically. In Proceedings of the ACM Conference on Principles of Programming Languages (POPL). htps: \/\/doi.org\/10","year":"2014","author":"Miller Andrew","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3240719.3241790"},{"volume-title":"Bitcoin: A peer-to-peer electronic cash system. htp:\/\/www.bitcoin.org\/bitcoin.pdf","year":"2009","author":"Nakamoto Satoshi","key":"e_1_3_2_1_11_1"},{"volume-title":"26th USENIX Security Symposium, USENIX Security 2017","year":"2017","author":"Nikitin Kirill","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04652-0_5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3167086"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00114"},{"volume-title":"Skip Lists: A Probabilistic Alternative to Balanced Trees. Commun. ACM 33, 6 (","year":"1990","author":"Pugh William","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","unstructured":"Mark Russinovich Edward Ashton Christine Avanessians Miguel Castro Amaury Chamayou Sylvan Clebsch Manuel Costa C\u00e9-dric Fournet Matthew Kerner Sid Krishna etal 2019. CCF: A framework for building confidential verifiable replicated services. Technical Report. Technical Report MSR-TR-2019-16 Microsoft. htps:\/\/www.microsoft.com\/en-us\/research\/publication\/ccf-aframework-for-building-confidential-verifiable-replicated-services\/  Mark Russinovich Edward Ashton Christine Avanessians Miguel Castro Amaury Chamayou Sylvan Clebsch Manuel Costa C\u00e9-dric Fournet Matthew Kerner Sid Krishna et al. 2019. CCF: A framework for building confidential verifiable replicated services. Technical Report. Technical Report MSR-TR-2019-16 Microsoft. htps:\/\/www.microsoft.com\/en-us\/research\/publication\/ccf-aframework-for-building-confidential-verifiable-replicated-services\/"},{"first-page":"234","volume-title":"Proceedings of the 3rd Annual ACM\/IEEE International Conference on Mobile Computing and Networking","author":"Spreitzer Mike J.","key":"e_1_3_2_1_18_1"}],"event":{"name":"CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Virtual Denmark","acronym":"CPP '21"},"container-title":["Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437992.3439924","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437992.3439924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:18Z","timestamp":1750193238000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437992.3439924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,17]]},"references-count":17,"alternative-id":["10.1145\/3437992.3439924","10.1145\/3437992"],"URL":"https:\/\/doi.org\/10.1145\/3437992.3439924","relation":{},"subject":[],"published":{"date-parts":[[2021,1,17]]},"assertion":[{"value":"2021-01-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}