{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:03:33Z","timestamp":1773479013787,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"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.3439917","type":"proceedings-article","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T23:11:11Z","timestamp":1611184271000},"page":"5-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A formal proof of PAC learnability for decision stumps"],"prefix":"10.1145","author":[{"given":"Joseph","family":"Tassarotti","sequence":"first","affiliation":[{"name":"Boston College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3799-6326","authenticated-orcid":false,"given":"Koundinya","family":"Vajjha","sequence":"additional","affiliation":[{"name":"University of Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9979-1292","authenticated-orcid":false,"given":"Anindya","family":"Banerjee","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Baptiste","family":"Tristan","sequence":"additional","affiliation":[{"name":"Boston College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Reynald Afeldt Cyril Cohen Marie Kerjean Assia Mahboubi Damien Rouhling Kazuhiko Sakaguchi and Pierre-Yves Strub. 2020. mathcomp Analysis Library. htps:\/\/github.com\/math-comp\/analysis. Reynald Afeldt Cyril Cohen Marie Kerjean Assia Mahboubi Damien Rouhling Kazuhiko Sakaguchi and Pierre-Yves Strub. 2020. mathcomp Analysis Library. htps:\/\/github.com\/math-comp\/analysis."},{"key":"e_1_3_2_1_2_1","article-title":"Formalization of Shannon's Theorems","volume":"53","author":"Afeldt Reynald","year":"2014","unstructured":"Reynald Afeldt , Manabu Hagiwara , and Jonas S\u00e9nizergues . 2014 . Formalization of Shannon's Theorems . J. Autom. Reason. 53 , 1 ( 2014 ), 63-103. Reynald Afeldt, Manabu Hagiwara, and Jonas S\u00e9nizergues. 2014. Formalization of Shannon's Theorems. J. Autom. Reason. 53, 1 ( 2014 ), 63-103.","journal-title":"J. Autom. Reason."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Philippe Audebaud and Christine Paulin-Mohring. 2009. Proofs of randomized algorithms in Coq. Sci. Comput. Program. 74 8 ( 2009 ) 568-589. Philippe Audebaud and Christine Paulin-Mohring. 2009. Proofs of randomized algorithms in Coq. Sci. Comput. Program. 74 8 ( 2009 ) 568-589.","DOI":"10.1016\/j.scico.2007.09.002"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1215\/ijm\/1255631584"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-017-9404-x"},{"key":"e_1_3_2_1_6_1","volume-title":"Certifying the True Error: Machine Learning in Coq with Verified Generalization Guarantees. In AAAI'19: The Thirty-Third AAAI Conference on Artificial Intelligence. 2662-2669","author":"Bagnall Alexander","year":"2019","unstructured":"Alexander Bagnall and Gordon Stewart . 2019 . Certifying the True Error: Machine Learning in Coq with Verified Generalization Guarantees. In AAAI'19: The Thirty-Third AAAI Conference on Artificial Intelligence. 2662-2669 . Alexander Bagnall and Gordon Stewart. 2019. Certifying the True Error: Machine Learning in Coq with Verified Generalization Guarantees. In AAAI'19: The Thirty-Third AAAI Conference on Artificial Intelligence. 2662-2669."},{"key":"e_1_3_2_1_7_1","volume-title":"HOList: An Environment for Machine Learning of Higher Order Logic Theorem Proving. In Thirty-sixth International Conference on Machine Learning (ICML). 454-463","author":"Bansal Kshitij","year":"2019","unstructured":"Kshitij Bansal , Sarah M. Loos , Markus N. Rabe , Christian Szegedy , and Stewart Wilcox . 2019 . HOList: An Environment for Machine Learning of Higher Order Logic Theorem Proving. In Thirty-sixth International Conference on Machine Learning (ICML). 454-463 . Kshitij Bansal, Sarah M. Loos, Markus N. Rabe, Christian Szegedy, and Stewart Wilcox. 2019. HOList: An Environment for Machine Learning of Higher Order Logic Theorem Proving. In Thirty-sixth International Conference on Machine Learning (ICML). 454-463."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Gilles Barthe Fran\u00e7ois Dupressoir Benjamin Gr\u00e9goire C\u00e9sar Kunz Benedikt Schmidt and Pierre-Yves Strub. 2013. EasyCrypt: A Tutorial. In Foundations of Security Analysis and Design VII-FOSAD 2012 \/2013 Tutorial Lectures. 146-166. Gilles Barthe Fran\u00e7ois Dupressoir Benjamin Gr\u00e9goire C\u00e9sar Kunz Benedikt Schmidt and Pierre-Yves Strub. 2013. EasyCrypt: A Tutorial. In Foundations of Security Analysis and Design VII-FOSAD 2012 \/2013 Tutorial Lectures. 146-166.","DOI":"10.1007\/978-3-319-10082-1_6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1480881.1480894","article-title":"Formal certification of code-based cryptographic proofs","author":"Barthe Gilles","year":"2009","unstructured":"Gilles Barthe , Benjamin Gr\u00e9goire , and Santiago Zanella B\u00e9guelin . 2009 . Formal certification of code-based cryptographic proofs . In POPL. 90 - 101 . Gilles Barthe, Benjamin Gr\u00e9goire, and Santiago Zanella B\u00e9guelin. 2009. Formal certification of code-based cryptographic proofs. In POPL. 90-101.","journal-title":"POPL."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-018-9481-5"},{"key":"e_1_3_2_1_11_1","volume-title":"Synthetic topology in Homotopy Type Theory for probabilistic programming. CoRR abs\/1912.07339 ( 2019 ). arXiv","author":"Bidlingmaier Martin E.","year":"1912","unstructured":"Martin E. Bidlingmaier , Florian Faissole , and Bas Spitters . 2019. Synthetic topology in Homotopy Type Theory for probabilistic programming. CoRR abs\/1912.07339 ( 2019 ). arXiv : 1912 .07339 htp: \/\/arxiv.org\/abs\/ 1912.07339 Martin E. Bidlingmaier, Florian Faissole, and Bas Spitters. 2019. Synthetic topology in Homotopy Type Theory for probabilistic programming. CoRR abs\/1912.07339 ( 2019 ). arXiv: 1912.07339 htp: \/\/arxiv.org\/abs\/ 1912.07339"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 29th Conference on Learning Theory, COLT 2016. 698-728","author":"Cohen Nadav","year":"2016","unstructured":"Nadav Cohen , Or Sharir , and Amnon Shashua . 2016 . On the Expressive Power of Deep Learning: A Tensor Analysis . In Proceedings of the 29th Conference on Learning Theory, COLT 2016. 698-728 . Nadav Cohen, Or Sharir, and Amnon Shashua. 2016. On the Expressive Power of Deep Learning: A Tensor Analysis. In Proceedings of the 29th Conference on Learning Theory, COLT 2016. 698-728."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Leonardo Mendon\u00e7a de Moura Soonho Kong Jeremy Avigad Floris van Doorn and Jakob von Raumer. 2015. The Lean Theorem Prover (System Description). In CADE-25-25th International Conference on Automated Deduction. 378-388. Leonardo Mendon\u00e7a de Moura Soonho Kong Jeremy Avigad Floris van Doorn and Jakob von Raumer. 2015. The Lean Theorem Prover (System Description). In CADE-25-25th International Conference on Automated Deduction. 378-388.","DOI":"10.1007\/978-3-319-21401-6_26"},{"key":"e_1_3_2_1_16_1","volume-title":"Uniform Central Limit Theorems","author":"Dudley R. M.","unstructured":"R. M. Dudley . 2014. Uniform Central Limit Theorems ( 2 nd ed.). Cambridge University Press . R. M. Dudley. 2014. Uniform Central Limit Theorems (2nd ed.). Cambridge University Press.","edition":"2"},{"key":"e_1_3_2_1_17_1","first-page":"196","article-title":"Verified Analysis of Random Trees","author":"Eberl Manuel","year":"2018","unstructured":"Manuel Eberl , Max W. Haslbeck , and Tobias Nipkow . 2018 . Verified Analysis of Random Trees . In ITP. 196 - 214 . Manuel Eberl, Max W. Haslbeck, and Tobias Nipkow. 2018. Verified Analysis of Random Trees. In ITP. 196-214.","journal-title":"ITP."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0092872"},{"key":"e_1_3_2_1_19_1","volume-title":"Certifying Certainty and Uncertainty in Approximate Membership Query Structures","author":"Gopinathan Kiran","unstructured":"Kiran Gopinathan and Ilya Sergey . 2020. Certifying Certainty and Uncertainty in Approximate Membership Query Structures . In CAV, Shuvendu K. Lahiri and Chao Wang (Eds.). 279-303. Kiran Gopinathan and Ilya Sergey. 2020. Certifying Certainty and Uncertainty in Approximate Membership Query Structures. In CAV, Shuvendu K. Lahiri and Chao Wang (Eds.). 279-303."},{"key":"e_1_3_2_1_21_1","first-page":"135","article-title":"Three Chapters of Measure Theory in Isabelle\/HOL","author":"H\u00f6lzl Johannes","year":"2011","unstructured":"Johannes H\u00f6lzl and Armin Heller . 2011 . Three Chapters of Measure Theory in Isabelle\/HOL . In ITP. 135 - 151 . Johannes H\u00f6lzl and Armin Heller. 2011. Three Chapters of Measure Theory in Isabelle\/HOL. In ITP. 135-151.","journal-title":"ITP."},{"key":"e_1_3_2_1_22_1","volume-title":"GamePad: A Learning Environment for Theorem Proving. In 7th International Conference on Learning Representations, ICLR","author":"Huang Daniel","year":"2019","unstructured":"Daniel Huang , Prafulla Dhariwal , Dawn Song , and Ilya Sutskever . 2019 . GamePad: A Learning Environment for Theorem Proving. In 7th International Conference on Learning Representations, ICLR 2019. Daniel Huang, Prafulla Dhariwal, Dawn Song, and Ilya Sutskever. 2019. GamePad: A Learning Environment for Theorem Proving. In 7th International Conference on Learning Representations, ICLR 2019."},{"key":"e_1_3_2_1_24_1","first-page":"1","article-title":"Hammering Mizar by Learning Clause Guidance (Short Paper)","volume":"34","author":"Jakubuv Jan","year":"2019","unstructured":"Jan Jakubuv and Josef Urban . 2019 . Hammering Mizar by Learning Clause Guidance (Short Paper) . In ITP. 34 : 1 - 34 : 8. Jan Jakubuv and Josef Urban. 2019. Hammering Mizar by Learning Clause Guidance (Short Paper). In ITP. 34 : 1-34 : 8.","journal-title":"ITP."},{"key":"e_1_3_2_1_25_1","volume-title":"HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving. In 5th International Conference on Learning Representations, ICLR","author":"Kaliszyk Cezary","year":"2017","unstructured":"Cezary Kaliszyk , Fran\u00e7ois Chollet , and Christian Szegedy . 2017 . HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving. In 5th International Conference on Learning Representations, ICLR 2017. Cezary Kaliszyk, Fran\u00e7ois Chollet, and Christian Szegedy. 2017. HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving. In 5th International Conference on Learning Representations, ICLR 2017."},{"key":"e_1_3_2_1_26_1","first-page":"8836","article-title":"Reinforcement Learning of Theorem Proving","author":"Kaliszyk Cezary","year":"2018","unstructured":"Cezary Kaliszyk , Josef Urban , Henryk Michalewski , and Miroslav Ols\u00e1k . 2018 . Reinforcement Learning of Theorem Proving . In NeurIPS. 8836 - 8847 . Cezary Kaliszyk, Josef Urban, Henryk Michalewski, and Miroslav Ols\u00e1k. 2018. Reinforcement Learning of Theorem Proving. In NeurIPS. 8836-8847.","journal-title":"NeurIPS."},{"key":"e_1_3_2_1_27_1","unstructured":"Robert Kam. 2008. coq-markov Library. htps:\/\/github.com\/coqcontribs\/markov. Robert Kam. 2008. coq-markov Library. htps:\/\/github.com\/coqcontribs\/markov."},{"key":"e_1_3_2_1_28_1","volume-title":"An Introduction to Computational Learning Theory","author":"Kearns Michael J","unstructured":"Michael J Kearns and Umesh Virkumar Vazirani . 1994. An Introduction to Computational Learning Theory . MIT press . Michael J Kearns and Umesh Virkumar Vazirani. 1994. An Introduction to Computational Learning Theory. MIT press."},{"key":"e_1_3_2_1_29_1","volume-title":"Foundations of Machine Learning","author":"Mohri Mehryar","unstructured":"Mehryar Mohri , Afshin Rostamizadeh , and Ameet Talwalkar . 2018. Foundations of Machine Learning . MIT press . Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar. 2018. Foundations of Machine Learning. MIT press."},{"key":"e_1_3_2_1_30_1","first-page":"53","article-title":"The Foundational Cryptography Framework","author":"Petcher Adam","year":"2015","unstructured":"Adam Petcher and Greg Morrisett . 2015 . The Foundational Cryptography Framework . In POST. 53 - 72 . Adam Petcher and Greg Morrisett. 2015. The Foundational Cryptography Framework. In POST. 53-72.","journal-title":"POST."},{"key":"e_1_3_2_1_31_1","volume-title":"Haskell Workshop.","author":"Jones Simon Peyton","year":"1997","unstructured":"Simon Peyton Jones , Mark Jones , and Erik Meijer . 1997 . Type classes: an exploration of the design space . In Haskell Workshop. Simon Peyton Jones, Mark Jones, and Erik Meijer. 1997. Type classes: an exploration of the design space. In Haskell Workshop."},{"key":"e_1_3_2_1_32_1","first-page":"427","volume-title":"Cryptography and Machine Learning. In Advances in Cryptology-ASIACRYPT '91","author":"Rivest Ronald L.","year":"1991","unstructured":"Ronald L. Rivest . 1991 . Cryptography and Machine Learning. In Advances in Cryptology-ASIACRYPT '91 . 427 - 439 . Ronald L. Rivest. 1991. Cryptography and Machine Learning. In Advances in Cryptology-ASIACRYPT '91. 427-439."},{"key":"e_1_3_2_1_33_1","first-page":"336","article-title":"Guiding High-Performance SAT Solvers with Unsat-Core Predictions","volume":"2019","author":"Selsam Daniel","year":"2019","unstructured":"Daniel Selsam and Nikolaj Bj\u00f8rner . 2019 . Guiding High-Performance SAT Solvers with Unsat-Core Predictions . In Theory and Applications of Satisfiability Testing-SAT 2019. 336 - 353 . Daniel Selsam and Nikolaj Bj\u00f8rner. 2019. Guiding High-Performance SAT Solvers with Unsat-Core Predictions. In Theory and Applications of Satisfiability Testing-SAT 2019. 336-353.","journal-title":"Theory and Applications of Satisfiability Testing-SAT"},{"key":"e_1_3_2_1_34_1","volume-title":"Developing Bug-Free Machine Learning Systems With Formal Mathematics. In International Conference on Machine Learning (ICML). 3047-3056","author":"Selsam Daniel","year":"2017","unstructured":"Daniel Selsam , Percy Liang , and David Dill . 2017 . Developing Bug-Free Machine Learning Systems With Formal Mathematics. In International Conference on Machine Learning (ICML). 3047-3056 . Daniel Selsam, Percy Liang, and David Dill. 2017. Developing Bug-Free Machine Learning Systems With Formal Mathematics. In International Conference on Machine Learning (ICML). 3047-3056."},{"key":"e_1_3_2_1_35_1","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"Shalev-Shwartz Shai","unstructured":"Shai Shalev-Shwartz and Shai Ben-David . 2014. Understanding Machine Learning: From Theory to Algorithms . Cambridge University Press . Shai Shalev-Shwartz and Shai Ben-David. 2014. Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_36_1","unstructured":"Joseph Tassarotti. 2020. coq-proba Probability Library. htps:\/\/github. com\/jtassaroti\/coq-proba. Joseph Tassarotti. 2020. coq-proba Probability Library. htps:\/\/github. com\/jtassaroti\/coq-proba."},{"key":"e_1_3_2_1_37_1","first-page":"560","article-title":"Verified Tail Bounds for Randomized Programs","author":"Tassarotti Joseph","year":"2018","unstructured":"Joseph Tassarotti and Robert Harper . 2018 . Verified Tail Bounds for Randomized Programs . In ITP. 560 - 578 . Joseph Tassarotti and Robert Harper. 2018. Verified Tail Bounds for Randomized Programs. In ITP. 560-578.","journal-title":"ITP."},{"key":"e_1_3_2_1_38_1","first-page":"367","article-title":"The Lean Mathematical Library","author":"Community The","year":"2020","unstructured":"The mathlib Community . 2020 . The Lean Mathematical Library . In CPP. 367 - 381 . The mathlib Community. 2020. The Lean Mathematical Library. In CPP. 367-381.","journal-title":"CPP."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Leslie G. Valiant. 1984. A Theory of the Learnable. Commun. ACM 27 11 ( 1984 ) 1134-1142. Leslie G. Valiant. 1984. A Theory of the Learnable. Commun. ACM 27 11 ( 1984 ) 1134-1142.","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_40_1","first-page":"256","article-title":"A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq","author":"van der Weegen Eelis","year":"2008","unstructured":"Eelis van der Weegen and James McKinna . 2008 . A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq . In TYPES. 256 - 271 . Eelis van der Weegen and James McKinna. 2008. A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq. In TYPES. 256-271.","journal-title":"TYPES."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1"},{"key":"e_1_3_2_1_42_1","unstructured":"Martin Zinkevich. 2020. htps:\/\/github.com\/google\/formal-ml Martin Zinkevich. 2020. htps:\/\/github.com\/google\/formal-ml"}],"event":{"name":"CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs","location":"Virtual Denmark","acronym":"CPP '21","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"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.3439917","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437992.3439917","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.3439917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,17]]},"references-count":40,"alternative-id":["10.1145\/3437992.3439917","10.1145\/3437992"],"URL":"https:\/\/doi.org\/10.1145\/3437992.3439917","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"}}]}}