{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:32:54Z","timestamp":1767929574308,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":48,"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.3503951","type":"proceedings-article","created":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T05:20:48Z","timestamp":1641964848000},"page":"2-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Coq\u2019s vibrant ecosystem for verification engineering (invited talk)"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6009-0325","authenticated-orcid":false,"given":"Andrew W.","family":"Appel","sequence":"first","affiliation":[{"name":"Princeton University, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Verified Software Toolchain. In ESOP\u201911: European Symposium on Programming, Gilles Barthe (Ed.) (LNCS","volume":"17","author":"Appel Andrew W.","year":"2011","unstructured":"Andrew W. Appel . 2011 . Verified Software Toolchain. In ESOP\u201911: European Symposium on Programming, Gilles Barthe (Ed.) (LNCS , Vol. 6602). Springer, 1\u2013 17 . Andrew W. Appel. 2011. Verified Software Toolchain. In ESOP\u201911: European Symposium on Programming, Gilles Barthe (Ed.) (LNCS, Vol. 6602). Springer, 1\u201317."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2701415"},{"key":"e_1_3_2_1_3_1","volume-title":"Modular Verification for Computer Security. In CSF 2016: 29th IEEE Computer Security Foundations Symposium. 1\u20138.","author":"Appel Andrew W.","year":"2016","unstructured":"Andrew W. Appel . 2016 . Modular Verification for Computer Security. In CSF 2016: 29th IEEE Computer Security Foundations Symposium. 1\u20138. Andrew W. Appel. 2016. Modular Verification for Computer Security. In CSF 2016: 29th IEEE Computer Security Foundations Symposium. 1\u20138."},{"key":"e_1_3_2_1_4_1","unstructured":"Andrew W. Appel. 2107. Verified Functional Algorithms (Software Foundations Vol. 3). softwarefoundations.org.  Andrew W. Appel. 2107. Verified Functional Algorithms (Software Foundations Vol. 3). softwarefoundations.org."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.6092\/issn.1972-5787\/11442"},{"key":"e_1_3_2_1_6_1","volume-title":"Program Logics for Certified Compilers","author":"Appel Andrew W.","unstructured":"Andrew W. Appel , Robert Dockins , Aquinas Hobor , Lennart Beringer , Josiah Dodds , Gordon Stewart , Sandrine Blazy , and Xavier Leroy . 2014. Program Logics for Certified Compilers . Cambridge . Andrew W. Appel, Robert Dockins, Aquinas Hobor, Lennart Beringer, Josiah Dodds, Gordon Stewart, Sandrine Blazy, and Xavier Leroy. 2014. Program Logics for Certified Compilers. Cambridge."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190235"},{"key":"e_1_3_2_1_8_1","volume-title":"Verified Sequential Malloc\/Free. In International Symposium on Memory Management (ISMM). 48\u201359","author":"Andrew","unstructured":"Andrew W. Appel and David A. Naumann. 2020 . Verified Sequential Malloc\/Free. In International Symposium on Memory Management (ISMM). 48\u201359 . Andrew W. Appel and David A. Naumann. 2020. Verified Sequential Malloc\/Free. In International Symposium on Memory Management (ISMM). 48\u201359."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290384"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-020-00353-1"},{"key":"e_1_3_2_1_11_1","volume-title":"Verified Correctness and Security of OpenSSL HMAC. In 24th USENIX Security Symposium. USENIX Assocation, 207\u2013221","author":"Beringer Lennart","unstructured":"Lennart Beringer , Adam Petcher , Katherine Q. Ye , and Andrew W. Appel . 2015 . Verified Correctness and Security of OpenSSL HMAC. In 24th USENIX Security Symposium. USENIX Assocation, 207\u2013221 . Lennart Beringer, Adam Petcher, Katherine Q. Ye, and Andrew W. Appel. 2015. Verified Correctness and Security of OpenSSL HMAC. In 24th USENIX Security Symposium. USENIX Assocation, 207\u2013221."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2013.30"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2011.40"},{"key":"e_1_3_2_1_14_1","volume-title":"Computer Arithmetic and Formal Proofs: Verifying Floating-point Algorithms with the Coq System","author":"Boldo Sylvie","unstructured":"Sylvie Boldo and Guillaume Melquiond . 2017. Computer Arithmetic and Formal Proofs: Verifying Floating-point Algorithms with the Coq System . Elsevier . Sylvie Boldo and Guillaume Melquiond. 2017. Computer Arithmetic and Formal Proofs: Verifying Floating-point Algorithms with the Coq System. Elsevier."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385965"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-018-9457-5"},{"key":"e_1_3_2_1_17_1","volume-title":"Appel","author":"Cao Qinxiang","year":"2018","unstructured":"Qinxiang Cao , Shengyi Wang , Aquinas Hobor , and Andrew W . Appel . 2018 . Proof Pearl : Magic Wand as Frame . https:\/\/www.cs.princeton.edu\/~appel\/papers\/wand-frame.pdf Qinxiang Cao, Shengyi Wang, Aquinas Hobor, and Andrew W. Appel. 2018. Proof Pearl: Magic Wand as Frame. https:\/\/www.cs.princeton.edu\/~appel\/papers\/wand-frame.pdf"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034828"},{"key":"e_1_3_2_1_19_1","volume-title":"Appel","author":"Cohen Joshua M.","year":"2021","unstructured":"Joshua M. Cohen , Qinshi Wang , and Andrew W . Appel . 2021 . Verified Forward Erasure Correction in Coq . in preparation. Joshua M. Cohen, Qinshi Wang, and Andrew W. Appel. 2021. Verified Forward Erasure Correction in Coq. in preparation."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290316"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676975"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54434-1_22"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48256-3_9"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2007.70772"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20398-5_4"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the ACM on Programming Languages, 2, POPL","author":"Jung Ralf","year":"2017","unstructured":"Ralf Jung , Jacques-Henri Jourdan , Robbert Krebbers , and Derek Dreyer . 2017 . RustBelt: Securing the foundations of the Rust programming language . Proceedings of the ACM on Programming Languages, 2, POPL (2017), 1\u201334. Ralf Jung, Jacques-Henri Jourdan, Robbert Krebbers, and Derek Dreyer. 2017. RustBelt: Securing the foundations of the Rust programming language. Proceedings of the ACM on Programming Languages, 2, POPL (2017), 1\u201334."},{"key":"e_1_3_2_1_27_1","volume-title":"Iris from the ground up: A modular foundation for higher-order concurrent separation logic. Journal of Functional Programming, 28","author":"Jung Ralf","year":"2018","unstructured":"Ralf Jung , Robbert Krebbers , Jacques-Henri Jourdan , Ale\u0161 Bizjak , Lars Birkedal , and Derek Dreyer . 2018. Iris from the ground up: A modular foundation for higher-order concurrent separation logic. Journal of Functional Programming, 28 ( 2018 ). Ralf Jung, Robbert Krebbers, Jacques-Henri Jourdan, Ale\u0161 Bizjak, Lars Birkedal, and Derek Dreyer. 2018. Iris from the ground up: A modular foundation for higher-order concurrent separation logic. Journal of Functional Programming, 28 (2018)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-014-0326-7"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629596"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293880.3294106"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-021-09604-0"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236772"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2578855.2535841"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17511-4_20"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538814"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.4457887"},{"key":"e_1_3_2_1_37_1","unstructured":"William Mansky. 2022. Bringing Iris into the Verified Software Toolchain. (in preparation).  William Mansky. 2022. Bringing Iris into the Verified Software Toolchain. (in preparation)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133911"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/44501.45065"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81688-9_37"},{"key":"e_1_3_2_1_41_1","volume-title":"Principles of Security and Trust (POST\u201915) (LNCS","author":"Petcher Adam","unstructured":"Adam Petcher and Greg Morrisett . 2015. The Foundational Cryptography Framework . In Principles of Security and Trust (POST\u201915) (LNCS , Vol. 9036). Springer, 53\u2013 72 . Adam Petcher and Greg Morrisett. 2015. The Foundational Cryptography Framework. In Principles of Security and Trust (POST\u201915) (LNCS, Vol. 9036). Springer, 53\u201372."},{"key":"e_1_3_2_1_42_1","volume-title":"Twenty Five Years of Constructive Type Theory","author":"Pollack Robert","unstructured":"Robert Pollack . 1998. How to Believe a Machine-Checked Proof . In Twenty Five Years of Constructive Type Theory , G. Sambin and J. Smith (Eds.). Oxford University Press . Robert Pollack. 1998. How to Believe a Machine-Checked Proof. In Twenty Five Years of Constructive Type Theory, G. Sambin and J. Smith (Eds.). Oxford University Press."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498693"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2854065.2854066"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1561\/2500000045"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454036"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360597"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133974"}],"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.3503951","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3497775.3503951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:49:26Z","timestamp":1750193366000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3497775.3503951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,11]]},"references-count":48,"alternative-id":["10.1145\/3497775.3503951","10.1145\/3497775"],"URL":"https:\/\/doi.org\/10.1145\/3497775.3503951","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"}}]}}