{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:17:11Z","timestamp":1750220231474,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["19485336, 2107035"],"award-info":[{"award-number":["19485336, 2107035"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-19-1-0054"],"award-info":[{"award-number":["W911NF-19-1-0054"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,21]]},"DOI":"10.1145\/3510454.3516853","type":"proceedings-article","created":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T16:16:28Z","timestamp":1666196188000},"page":"61-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynaplex"],"prefix":"10.1145","author":[{"given":"Didier","family":"Ishimwe","sequence":"first","affiliation":[{"name":"University of Nebraska-Lincoln"}]},{"given":"ThanhVu","family":"Nguyen","sequence":"additional","affiliation":[{"name":"George Mason University"}]},{"given":"KimHao","family":"Nguyen","sequence":"additional","affiliation":[{"name":"University of Nebraska-Lincoln"}]}],"member":"320","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018353700639"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386035"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3339984","article-title":"Non-polynomial worst-case analysis of recursive programs","volume":"41","author":"Chatterjee Krishnendu","year":"2019","unstructured":"Krishnendu Chatterjee , Hongfei Fu , and Amir Kafshdar Goharshady . 2019 . Non-polynomial worst-case analysis of recursive programs . ACM Transactions on Programming Languages and Systems 41 , 4 (2019), 1 -- 52 . Krishnendu Chatterjee, Hongfei Fu, and Amir Kafshdar Goharshady. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems 41, 4 (2019), 1--52.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"volume-title":"Introduction to algorithms","author":"Cormen Thomas H","key":"e_1_3_2_1_4_1","unstructured":"Thomas H Cormen , Charles E Leiserson , Ronald L Rivest , and Clifford Stein . 2009. Introduction to algorithms . MIT press . Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2009. Introduction to algorithms. MIT press."},{"key":"e_1_3_2_1_5_1","volume-title":"SPEED: Symbolic Complexity Bound Analysis. In Computer Aided Verification","author":"Gulwani Sumit","year":"2009","unstructured":"Sumit Gulwani . 2009 . SPEED: Symbolic Complexity Bound Analysis. In Computer Aided Verification . Springer-Verlag , 51--62. Sumit Gulwani. 2009. SPEED: Symbolic Complexity Bound Analysis. In Computer Aided Verification. Springer-Verlag, 51--62."},{"key":"e_1_3_2_1_6_1","volume-title":"Chilimbi","author":"Gulwani Sumit","year":"2009","unstructured":"Sumit Gulwani , Krishna K. Mehra , and Trishul M . Chilimbi . 2009 . SPEED: precise and efficient static estimation of program computational complexity. In Principles of Programming Languages. ACM , 127--139. Sumit Gulwani, Krishna K. Mehra, and Trishul M. Chilimbi. 2009. SPEED: precise and efficient static estimation of program computational complexity. In Principles of Programming Languages. ACM, 127--139."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-020-2649-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/640128.604148"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485515"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.5421762"},{"key":"e_1_3_2_1_11_1","first-page":"293","article-title":"Multiplication of many-digital numbers by automatic computers","volume":"145","author":"Karatsuba Anatolii Alekseevich","year":"1962","unstructured":"Anatolii Alekseevich Karatsuba and Yu P Ofman . 1962 . Multiplication of many-digital numbers by automatic computers . In Russian Academy of Sciences , Vol. 145. 293 -- 294 . Anatolii Alekseevich Karatsuba and Yu P Ofman. 1962. Multiplication of many-digital numbers by automatic computers. In Russian Academy of Sciences, Vol. 145. 293--294.","journal-title":"Russian Academy of Sciences"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140587.3062373"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3213846.3213874"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"ThanhVu Nguyen Timos Antopoulos Andrew Ruef and Michael Hicks. 2017. A Counterexample-guided Approach to Finding Numerical Invariants. In Foundations of Software Engineering. ACM 605--615.  ThanhVu Nguyen Timos Antopoulos Andrew Ruef and Michael Hicks. 2017. A Counterexample-guided Approach to Finding Numerical Invariants. In Foundations of Software Engineering. ACM 605--615.","DOI":"10.1145\/3106237.3106281"},{"volume-title":"Automated Software Engineering","author":"Nguyen ThanhVu","key":"e_1_3_2_1_15_1","unstructured":"ThanhVu Nguyen , Matthew Dwyer , and William Visser . 2017. SymInfer: Inferring Program Invariants using Symbolic States . In Automated Software Engineering . IEEE , 804--814. ThanhVu Nguyen, Matthew Dwyer, and William Visser. 2017. SymInfer: Inferring Program Invariants using Symbolic States. In Automated Software Engineering. IEEE, 804--814."},{"key":"e_1_3_2_1_16_1","volume-title":"https:\/\/termcomp.github.io\/, accessed on","author":"Competitions Termination","year":"2022","unstructured":"Termination Competitions . 2021. Complexity Benchmarks . https:\/\/termcomp.github.io\/, accessed on February 10, 2022 . Termination Competitions. 2021. Complexity Benchmarks. https:\/\/termcomp.github.io\/, accessed on February 10, 2022."}],"event":{"name":"ICSE '22: 44th International Conference on Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"],"location":"Pittsburgh Pennsylvania","acronym":"ICSE '22"},"container-title":["Proceedings of the ACM\/IEEE 44th International Conference on Software Engineering: Companion Proceedings"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510454.3516853","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510454.3516853","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510454.3516853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:15Z","timestamp":1750188615000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510454.3516853"}},"subtitle":["inferring asymptotic runtime complexity of recursive programs"],"short-title":[],"issued":{"date-parts":[[2022,5,21]]},"references-count":16,"alternative-id":["10.1145\/3510454.3516853","10.1145\/3510454"],"URL":"https:\/\/doi.org\/10.1145\/3510454.3516853","relation":{},"subject":[],"published":{"date-parts":[[2022,5,21]]},"assertion":[{"value":"2022-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}