{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:13:05Z","timestamp":1778602385967,"version":"3.51.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031453311","type":"print"},{"value":"9783031453328","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45332-8_14","type":"book-chapter","created":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T05:01:36Z","timestamp":1697605296000},"page":"263-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["pymwp: A Static Analyzer Determining Polynomial Growth Bounds"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6346-3043","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Aubert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Rubiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7354-5330","authenticated-orcid":false,"given":"Neea","family":"Rusch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6313-0898","authenticated-orcid":false,"given":"Thomas","family":"Seiller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,19]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.tcs.2011.07.009","volume":"413","author":"E Albert","year":"2012","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost analysis of object-oriented bytecode programs. Theor. Comput. Sci. 413(1), 142\u2013159 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2011.07.009","journal-title":"Theor. Comput. Sci."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-15769-1_8","volume-title":"Static Analysis","author":"C Alias","year":"2010","unstructured":"Alias, C., Darte, A., Feautrier, P., Gonnord, L.: Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol. 6337, pp. 117\u2013133. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15769-1_8"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Aubert, C., Rubiano, T., Rusch, N., Seiller, T.: Certifying complexity analysis (2023). https:\/\/hal.science\/hal-04083105v1\/file\/main.pdf. Presented at the Ninth International Workshop on Coq for Programming Languages (CoqPL)","DOI":"10.1007\/978-3-031-24950-1_1"},{"key":"14_CR4","unstructured":"Aubert, C., Rubiano, T., Rusch, N., Seiller, T.: LQICM On C Toy Parser (2021). https:\/\/github.com\/statycc\/LQICM_On_C_Toy_Parser"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Aubert, C., Rubiano, T., Rusch, N., Seiller, T.: mwp-analysis improvement and implementation: realizing implicit computational complexity. In: Felty, A.P. (ed.) 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Leibniz International Proceedings in Informatics, vol. 228, pp. 26:1\u201326:23. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2022.26","DOI":"10.4230\/LIPIcs.FSCD.2022.26"},{"key":"14_CR6","unstructured":"Aubert, C., Rubiano, T., Rusch, N., Seiller, T.: Realizing Implicit Computational Complexity (2022). https:\/\/hal.archives-ouvertes.fr\/hal-03603510. Presented at the 28th International Conference on Types for Proofs and Programs (TYPES 2022) (Recording)"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Aubert, C., Rubiano, T., Rusch, N., Seiller, T.: pymwp: MWP analysis on C code in Python (2023). https:\/\/doi.org\/10.5281\/zenodo.7908484","DOI":"10.5281\/zenodo.7908484"},{"issue":"4","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2866575","volume":"38","author":"M Brockschmidt","year":"2016","unstructured":"Brockschmidt, M., Emmes, F., Falke, S., Fuhs, C., Giesl, J.: Analyzing runtime and size complexity of integer programs. ACM Trans. Programm. Lang. Syst. (TOPLAS) 38(4), 1\u201350 (2016). https:\/\/doi.org\/10.1145\/2866575","journal-title":"ACM Trans. Programm. Lang. Syst. (TOPLAS)"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Carbonneaux, Q., Hoffmann, J., Shao, Z.: Compositional certified resource bounds. In: Grove, D., Blackburn, S.M. (eds.) Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 467\u2013478. Association for Computing Machinery (2015). https:\/\/doi.org\/10.1145\/2737924.2737955","DOI":"10.1145\/2737924.2737955"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-31485-8_3","volume-title":"Lectures on Logic and Computation","author":"U Dal Lago","year":"2012","unstructured":"Dal Lago, U.: A short introduction to implicit computational complexity. In: Bezhanishvili, N., Goranko, V. (eds.) ESSLLI 2010-2011. LNCS, vol. 7388, pp. 89\u2013109. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31485-8_3"},{"key":"14_CR11","unstructured":"Flores Montoya, A.: Cost Analysis of Programs Based on the Refinement of Cost Relations. Ph.D. thesis, Technische Universit\u00e4t, Darmstadt (2017). http:\/\/tuprints.ulb.tu-darmstadt.de\/6746\/"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-12736-1_15","volume-title":"Programming Languages and Systems","author":"A Flores-Montoya","year":"2014","unstructured":"Flores-Montoya, A., H\u00e4hnle, R.: Resource analysis of complex programs with cost equations. In: Garrigue, J. (ed.) APLAS 2014. LNCS, vol. 8858, pp. 275\u2013295. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12736-1_15"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10817-016-9388-y","volume":"58","author":"J Giesl","year":"2016","unstructured":"Giesl, J., et al.: Resource analysis of complex programs with cost equations. J. Autom. Reasoning 58(1), 3\u201331 (2016). https:\/\/doi.org\/10.1007\/s10817-016-9388-y","journal-title":"J. Autom. Reasoning"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-030-85315-0_20","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2021","author":"E Hainry","year":"2021","unstructured":"Hainry, E., Jeandel, E., P\u00e9choux, R., Zeyen, O.: ComplexityParser: an automatic tool for certifying poly-time complexity of Java programs. In: Cerone, A., \u00d6lveczky, P.C. (eds.) ICTAC 2021. LNCS, vol. 12819, pp. 357\u2013365. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85315-0_20"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-642-31424-7_64","volume-title":"Computer Aided Verification","author":"J Hoffmann","year":"2012","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Resource aware ML. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 781\u2013786. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_64"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/1555746.1555752","volume":"10","author":"ND Jones","year":"2009","unstructured":"Jones, N.D., Kristiansen, L.: A flow calculus of mwp-bounds for complexity analysis. ACM Trans. Comput. Logic 10(4), 28:1-28:41 (2009). https:\/\/doi.org\/10.1145\/1555746.1555752","journal-title":"ACM Trans. Comput. Logic"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-319-90686-7_14","volume-title":"Functional and Logic Programming","author":"G Moser","year":"2018","unstructured":"Moser, G., Schneckenreither, M.: Automated amortised resource analysis for term rewrite systems. In: Gallagher, J.P., Sulzmann, M. (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 214\u2013229. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90686-7_14"},{"key":"14_CR18","unstructured":"Moyen, J.: Implicit Complexity in Theory and Practice. Habilitation thesis, University of Copenhagen (2017). https:\/\/lipn.univ-paris13.fr\/moyen\/papiers\/Habilitation_JY_Moyen.pdf"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-68167-2_7","volume-title":"Automated Technology for Verification and Analysis","author":"J-Y Moyen","year":"2017","unstructured":"Moyen, J.-Y., Rubiano, T., Seiller, T.: Loop quasi-invariant chunk detection. In: D\u2019Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 91\u2013108. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68167-2_7"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Moyen, J., Rubiano, T., Seiller, T.: Loop quasi-invariant chunk motion by peeling with statement composition. In: Bonfante, G., Moser, G. (eds.) Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, DICE-FOPARA@ETAPS 2017, Uppsala, Sweden, 22\u201323 April 2017. Electronic Proceedings in Theoretical Computer Science, 248, pp. 47\u201359, 2017. https:\/\/doi.org\/10.4204\/EPTCS.248.9, http:\/\/arxiv.org\/abs\/1704.05169","DOI":"10.4204\/EPTCS.248.9"},{"key":"14_CR21","unstructured":"pycparser - Complete C99 parser in pure Python. https:\/\/github.com\/eliben\/pycparser"},{"key":"14_CR22","unstructured":"pymwp at Python Package Index (2023). https:\/\/pypi.org\/project\/pymwp\/"},{"key":"14_CR23","unstructured":"pymwp documentation (2023). https:\/\/statycc.github.io\/pymwp\/"},{"key":"14_CR24","unstructured":"pymwp source code repository (2023). https:\/\/github.com\/statycc\/pymwp"},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10817-016-9402-4","volume":"59","author":"M Sinn","year":"2017","unstructured":"Sinn, M., Zuleger, F., Veith, H.: Complexity and resource bound analysis of imperative programs using difference constraints. J. Autom. Reasoning 59(1), 3\u201345 (2017). https:\/\/doi.org\/10.1007\/s10817-016-9402-4","journal-title":"J. Autom. Reasoning"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45332-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T05:04:06Z","timestamp":1697605446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45332-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453311","9783031453328"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45332-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"115","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.05","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7 tool papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}