<bibliography>
 <citation type="article" key="Benzinger">
  <author>Ralph <surname>Benzinger</surname></author>
  <year>2004</year>
  <title>Automated Higher-order Complexity Analysis</title>
  <journal>Theoretical Computer Science</journal>
  <volume>318</volume>
  <number>1-2</number>
  <pages>79&#8211;103</pages>
  <doi>10.1016/j.tcs.2003.10.022</doi>
 </citation>
 <citation type="article" key="BevierHuntMooreYoung89">
  <author>William R. <surname>Bevier</surname></author>
  <author>Warren <surname>Hunt, Jr.</surname></author>
  <author>J Strother <surname>Moore</surname></author>
  <author>William <surname>Young</surname></author>
  <year>1989</year>
  <title>An Approach to Systems Verification</title>
  <journal>Journal of Automated Reasoning</journal>
  <volume>5</volume>
  <number>4</number>
  <pages>411&#8211;428</pages>
  <doi>10.1007/BF00243131</doi>
 </citation>
 <citation type="article" key="BoyerMoore77">
  <author>Robert S. <surname>Boyer</surname></author>
  <author>J Strother <surname>Moore</surname></author>
  <year>1977</year>
  <title>A Fast String Searching Algorithm</title>
  <journal>Communications of the ACM</journal>
  <volume>20</volume>
  <number>10</number>
  <pages>762&#8211;772</pages>
  <doi>10.1145/359842.359859</doi>
 </citation>
 <citation type="incollection" key="BoyerMoore91">
  <author>Robert S. <surname>Boyer</surname></author>
  <author>J Strother <surname>Moore</surname></author>
  <year>1991</year>
  <title>MJRTY: A Fast Majority Vote Algorithm</title>
  <editor>Robert S. <surname>Boyer</surname></editor>
  <booktitle>Automated Reasoning: Essays in Honor of Woody Bledsoe</booktitle>
  <publisher>Kluwer Academic Publishers</publisher>
  <address>Dordrecht, The Netherlands</address>
  <pages>105&#8211;117</pages>
  <doi>10.1007/978-94-011-3488-0_5</doi>
 </citation>
 <citation type="incollection" key="BoyerMoore96">
  <author>Robert S. <surname>Boyer</surname></author>
  <author>J Strother <surname>Moore</surname></author>
  <year>1996</year>
  <title>Mechanized Formal Reasoning about Programs and Computing Machines</title>
  <editor>R. <surname>Veroff</surname></editor>
  <booktitle>Automated Reasoning and Its Applications: Essays in Honor of Larry Wos</booktitle>
  <publisher>MIT Press</publisher>
  <address>Boston</address>
  <pages>141&#8211;176</pages>
  <doi>10.1.1.27.8666</doi>
 </citation>
 <citation type="inproceedings" key="BrockKaufmannMoore96">
  <author>Bishop <surname>Brock</surname></author>
  <author>Matt <surname>Kaufmann</surname></author>
  <author>J Strother <surname>Moore</surname></author>
  <year>1996</year>
  <title>ACL2 Theorems about Commercial Microprocessors</title>
  <booktitle>Formal Methods in Computer-Aided Design (FMCAD'96)</booktitle>
  <publisher>Springer-Verlag</publisher>
  <pages>275&#8211;293</pages>
  <doi>10.1007/BFb0031816</doi>
 </citation>
 <citation type="inproceedings" key="Carbonneaux">
  <author>Q. <surname>Carbonneaux</surname></author>
  <author>J. <surname>Hoffmann</surname></author>
  <author>T.W. <surname>Reps</surname></author>
  <author>Z. <surname>Shao</surname></author>
  <year>2017</year>
  <title>Automated Resource Analysis with Coq Proof Objects</title>
  <booktitle>Computer Aided Verification (CAV 2017)</booktitle>
  <publisher>Springer-Verlag</publisher>
  <pages>64&#8211;85</pages>
  <doi>10.1007/978-3-319-22102-1_9</doi>
 </citation>
 <citation type="misc" key="Chargueraud">
  <author>A. <surname>Chargu&#233;raud</surname></author>
  <year>2019</year>
  <title>The CFML Tool and Library</title>
  <howpublished>https://www.chargueraud.org/softs/cfml/</howpublished>
 </citation>
 <citation type="article" key="ChargueraudPottier">
  <author>A. <surname>Chargu&#233;raud</surname></author>
  <author>F. <surname>Pottier</surname></author>
  <year>2019</year>
  <title>Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits</title>
  <journal>Journal of Automated Reasoning</journal>
  <volume>62</volume>
  <number>3</number>
  <pages>331&#8211;365</pages>
  <doi>10.1007/s10817-017-9431-7</doi>
 </citation>
 <citation type="inproceedings" key="CowlesGreveYoung">
  <author>John <surname>Cowles</surname></author>
  <author>David <surname>Greve</surname></author>
  <author>William <surname>Young</surname></author>
  <year>2007</year>
  <title>The While Language Challenge: First Progress</title>
  <booktitle>Proceedings of the Seventh International Workshop on the ACL2 Theorem Prover and its Applications</booktitle>
 </citation>
 <citation type="article" key="Flajolet">
  <author>Philippe <surname>Flajolet</surname></author>
  <author>Bruno <surname>Salvy</surname></author>
  <author>Paul <surname>Zimmermann</surname></author>
  <year>1991</year>
  <title>Automatic Average-Case Analysis of Algorithms</title>
  <journal>Theoretical Computer Science</journal>
  <volume>79</volume>
  <pages>37&#8211;109</pages>
  <doi>10.1016/0304-3975(91)90145-R</doi>
 </citation>
 <citation type="incollection" key="Gueneau18">
  <author>A. <surname>Gu&#233;neau</surname></author>
  <author>A. <surname>Chargu&#233;raud</surname></author>
  <author>F. <surname>Pottier</surname></author>
  <year>2018</year>
  <title>A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification</title>
  <editor>A. <surname>Ahmed</surname></editor>
  <booktitle>Programming Languages and Systems (ESOP 2018)</booktitle>
  <publisher>Springer</publisher>
  <address>New York</address>
  <doi>10.1007/978-3-319-89884-1_19</doi>
 </citation>
 <citation type="phdthesis" key="Gueneau20">
  <author>Arma&#235;l <surname>Gu&#233;neau</surname></author>
  <year>2020</year>
  <title>Mechanical Verification of the Correctness and Asymptotic Complexity of Programs: The Right Answer at the Right Time</title>
  <school>University of Paris</school>
 </citation>
 <citation type="article" key="HartmanisStearns">
  <author>Juris <surname>Hartmanis</surname></author>
  <author>Richard E. <surname>Stearns</surname></author>
  <year>1965</year>
  <title>On the computational complexity of algorithms</title>
  <journal>Transactions of the American Mathematical Society</journal>
  <volume>117</volume>
  <pages>285&#8211;306</pages>
  <doi>10.1090/S0002-9947-1965-0170805-7</doi>
 </citation>
 <citation type="article" key="HickeyCohen">
  <author>T. <surname>Hickey</surname></author>
  <author>J. <surname>Cohen</surname></author>
  <year>1988</year>
  <title>Automated Program Analysis</title>
  <journal>Journal of the ACM</journal>
  <volume>35</volume>
  <number>1</number>
  <pages>185&#8211;220</pages>
  <doi>10.1145/99370.99381</doi>
 </citation>
 <citation type="inproceedings" key="HofmannJost">
  <author>M. <surname>Hofmann</surname></author>
  <author>S. <surname>Jost</surname></author>
  <year>2003</year>
  <title>Static Prediction of Heap Space Usage for First-Order Functional Programs</title>
  <booktitle>Proceedings of the 30th ACM Symposium on Principles of Programming Languages</booktitle>
  <publisher>ACM</publisher>
  <pages>185&#8211;197</pages>
  <doi>10.1.1.175.6871</doi>
 </citation>
 <citation type="inbook" key="HuntKaufmannMooreSlobodova17">
  <author>Warren <surname>Hunt</surname></author>
  <author>Matt <surname>Kaufmann</surname></author>
  <author>J Strother <surname>Moore</surname></author>
  <author>Anna <surname>Slobodova</surname></author>
  <year>2017</year>
  <title>Verified Trustworthy Software Systems</title>
  <chapter>Industrial Hardware and Software Verification with ACL2</chapter>
  <series>Philosophical Transactions A, vol. 374</series>
  <publisher>Royal Society Publishing</publisher>
  <doi>10.1098/rsta.2015.0399</doi>
 </citation>
 <citation type="inproceedings" key="Iqbal19">
  <author>N. <surname>Iqbal</surname></author>
  <author>O. <surname>Hasan</surname></author>
  <author>U. <surname>Siddique</surname></author>
  <author>F. <surname>Awwad</surname></author>
  <year>2019</year>
  <title>Formalization of Asymptotic Notations in HOL-4</title>
  <booktitle>4th International Conference on Computer and Commumication Systems</booktitle>
  <publisher>IEEE</publisher>
  <pages>383&#8211;387</pages>
  <doi>10.1007/978-3-030-78409-6_5</doi>
 </citation>
 <citation type="article" key="LeMetayer">
  <author>Daniel <surname>Le M&#233;tayer</surname></author>
  <year>1988</year>
  <title>ACE: an automatic complexity evaluator</title>
  <journal>ACM Transactions on Programming Languages and Systems</journal>
  <volume>10</volume>
  <number>2</number>
  <pages>248&#8211;266</pages>
  <doi>10.1145/42190.42347</doi>
 </citation>
 <citation type="inbook" key="Moore99">
  <author>J Strother <surname>Moore</surname></author>
  <year>1999</year>
  <title>Correct System Design&#8212;Recent Insights and Advances</title>
  <chapter>Proving Theorems about Java-like Byte Code</chapter>
  <pages>139&#8211;162</pages>
  <series>LNCS: State of the Art Survey, vol. 1710</series>
  <publisher>Springer-Verlag</publisher>
  <doi>10.1007/3-540-48092-7_7</doi>
 </citation>
 <citation type="article" key="NipkowBrinkop">
  <author>T. <surname>Nipkow</surname></author>
  <author>H. <surname>Brinkop</surname></author>
  <year>2019</year>
  <title>Amortized Complexity Verified</title>
  <journal>Journal of Automated Reasoning</journal>
  <volume>62</volume>
  <pages>367&#8211;391</pages>
  <doi>10.1007/s10817-018-9459-3</doi>
 </citation>
 <citation type="incollection" key="RayMoore">
  <author>S. <surname>Ray</surname></author>
  <author>J S. <surname>Moore</surname></author>
  <year>2004</year>
  <title>Proof Styles in Operational Semantics</title>
  <editor>A. J. <surname>Hu</surname></editor>
  <editor>A. K. <surname>Martin</surname></editor>
  <booktitle>Proceedings of the 5th International Conference on Formal Methods in Computer-aided Design (FMCAD 2004): LNCS 3312</booktitle>
  <publisher>Springer-Verlag</publisher>
  <address>New York</address>
  <pages>67&#8211;81</pages>
  <doi>10.1007/978-3-540-30494-4_6</doi>
 </citation>
 <citation type="book" key="Sipser">
  <author>Michael <surname>Sipser</surname></author>
  <year>2006</year>
  <title>Introduction to the Theory of Computation (Second Edition)</title>
  <publisher>Thompson Course Technology</publisher>
  <address>Boston</address>
 </citation>
 <citation type="article" key="Wegbreit">
  <author>Ben <surname>Wegbreit</surname></author>
  <year>1975</year>
  <title>Mechanical Program Analysis</title>
  <journal>Communications of the ACM</journal>
  <volume>18</volume>
  <number>9</number>
  <pages>528&#8211;539</pages>
  <doi>10.1145/361002.361016</doi>
 </citation>
</bibliography>
