{"id":"https://openalex.org/W2950357695","doi":"https://doi.org/10.23638/lmcs-16(2:4)2020","title":"Tight Polynomial Worst-Case Bounds for Loop Programs","display_name":"Tight Polynomial Worst-Case Bounds for Loop Programs","publication_year":2020,"publication_date":"2020-05-14","ids":{"openalex":"https://openalex.org/W2950357695","doi":"https://doi.org/10.23638/lmcs-16(2:4)2020","mag":"2950357695"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-16(2:4)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(2:4)2020","pdf_url":"https://lmcs.episciences.org/6477/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/6477/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019616888","display_name":"Amir M. Ben-Amram","orcid":null},"institutions":[{"id":"https://openalex.org/I4210141777","display_name":"Academic College of Tel Aviv-Yafo","ror":"https://ror.org/04cg6c004","country_code":"IL","type":"education","lineage":["https://openalex.org/I4210141777"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Amir M. Ben-Amram","raw_affiliation_strings":["The Academic College of Tel Aviv-Yaffo"],"affiliations":[{"raw_affiliation_string":"The Academic College of Tel Aviv-Yaffo","institution_ids":["https://openalex.org/I4210141777"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013013246","display_name":"Geoff Hamilton","orcid":"https://orcid.org/0000-0001-5954-6444"},"institutions":[{"id":"https://openalex.org/I42934936","display_name":"Dublin City University","ror":"https://ror.org/04a1a1e81","country_code":"IE","type":"education","lineage":["https://openalex.org/I42934936"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Geoff Hamilton","raw_affiliation_strings":["Dublin City University"],"affiliations":[{"raw_affiliation_string":"Dublin City University","institution_ids":["https://openalex.org/I42934936"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019616888"],"corresponding_institution_ids":["https://openalex.org/I4210141777"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00592303,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 16, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/monoid","display_name":"Monoid","score":0.6510858535766602},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.6466149091720581},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6168262958526611},{"id":"https://openalex.org/keywords/weierstrass-factorization-theorem","display_name":"Weierstrass factorization theorem","score":0.6097209453582764},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5843073129653931},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5626698136329651},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.53354412317276},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5142509341239929},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5125224590301514},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.4314606785774231},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42290979623794556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14927005767822266}],"concepts":[{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.6510858535766602},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.6466149091720581},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6168262958526611},{"id":"https://openalex.org/C74497983","wikidata":"https://www.wikidata.org/wiki/Q1330788","display_name":"Weierstrass factorization theorem","level":3,"score":0.6097209453582764},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5843073129653931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5626698136329651},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.53354412317276},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5142509341239929},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5125224590301514},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.4314606785774231},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42290979623794556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14927005767822266},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-16(2:4)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(2:4)2020","pdf_url":"https://lmcs.episciences.org/6477/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1906.10047","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1906.10047","pdf_url":"https://arxiv.org/pdf/1906.10047","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1906.10047","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1906.10047","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-16(2:4)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(2:4)2020","pdf_url":"https://lmcs.episciences.org/6477/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320865","display_name":"Dublin City University","ror":"https://ror.org/04a1a1e81"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2950357695.pdf","grobid_xml":"https://content.openalex.org/works/W2950357695.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1484509862","https://openalex.org/W1523037784","https://openalex.org/W1548801608","https://openalex.org/W1622830285","https://openalex.org/W1983764301","https://openalex.org/W1991376038","https://openalex.org/W1993129359","https://openalex.org/W2003141394","https://openalex.org/W2003295303","https://openalex.org/W2011665527","https://openalex.org/W2048694918","https://openalex.org/W2051600983","https://openalex.org/W2058033966","https://openalex.org/W2060213695","https://openalex.org/W2062873592","https://openalex.org/W2071713296","https://openalex.org/W2072088733","https://openalex.org/W2083350000","https://openalex.org/W2094712524","https://openalex.org/W2115581182","https://openalex.org/W2160527279","https://openalex.org/W2461846980","https://openalex.org/W2533836568","https://openalex.org/W2577171054","https://openalex.org/W2605065382","https://openalex.org/W2791777217","https://openalex.org/W2888926773","https://openalex.org/W2889462571","https://openalex.org/W2962995303","https://openalex.org/W2963164018","https://openalex.org/W3100037762"],"related_works":["https://openalex.org/W4205186527","https://openalex.org/W2091391786","https://openalex.org/W3045724912","https://openalex.org/W4321274648","https://openalex.org/W4319924173","https://openalex.org/W3083991982","https://openalex.org/W2165093535","https://openalex.org/W2007546180","https://openalex.org/W3201236566","https://openalex.org/W4281725010"],"abstract_inverted_index":{"In":[0],"2008,":[1],"Ben-Amram,":[2],"Jones":[3],"and":[4,21,26,60],"Kristiansen":[5],"showed":[6],"that":[7,116],"for":[8,93],"a":[9,36,45,54,73,77,100,104,140,147],"simple":[10],"programming":[11],"language":[12],"-":[13,28],"representing":[14],"non-deterministic":[15],"imperative":[16],"programs":[17],"with":[18],"bounded":[19],"loops,":[20],"arithmetics":[22],"limited":[23],"to":[24,32,64,71,86],"addition":[25],"multiplication":[27],"it":[29,108,123],"is":[30,99,115,119,135],"possible":[31],"decide":[33],"precisely":[34],"whether":[35,44],"program":[37],"has":[38,53],"certain":[39],"growth-rate":[40],"properties,":[41],"in":[42,132],"particular":[43],"computed":[46],"value,":[47],"or":[48],"the":[49,68,117,133,136],"program's":[50],"running":[51],"time,":[52],"polynomial":[55,79,91,105],"growth":[56],"rate.":[57],"A":[58,112],"natural":[59],"intriguing":[61],"problem":[62,70],"was":[63],"move":[65],"from":[66],"answering":[67],"decision":[69],"giving":[72],"quantitative":[74],"result,":[75],"namely,":[76],"tight":[78],"upper":[80],"bound.":[81],"This":[82,98],"paper":[83],"shows":[84],"how":[85],"obtain":[87],"asymptotically-tight,":[88],"multivariate,":[89],"disjunctive":[90],"bounds":[92],"this":[94],"class":[95],"of":[96],"programs.":[97],"complete":[101],"solution:":[102],"whenever":[103],"bound":[106],"exists":[107],"will":[109],"be":[110],"found.":[111],"pleasant":[113],"surprise":[114],"algorithm":[118],"quite":[120],"simple;":[121],"but":[122],"relies":[124],"on":[125,144],"some":[126],"subtle":[127],"reasoning.":[128],"An":[129],"important":[130],"ingredient":[131],"proof":[134],"forest":[137],"factorization":[138],"theorem,":[139],"strong":[141],"structural":[142],"result":[143],"homomorphisms":[145],"into":[146],"finite":[148],"monoid.":[149]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}