{"id":"https://openalex.org/W4411267078","doi":"https://doi.org/10.1145/3729323","title":"Exact Loop Bound Analysis","display_name":"Exact Loop Bound Analysis","publication_year":2025,"publication_date":"2025-06-10","ids":{"openalex":"https://openalex.org/W4411267078","doi":"https://doi.org/10.1145/3729323"},"language":"en","primary_location":{"id":"doi:10.1145/3729323","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729323","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3729323","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3729323","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118484359","display_name":"Daniel Riley","orcid":"https://orcid.org/0000-0002-6390-9778"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Riley","raw_affiliation_strings":["Florida State University, Tallahassee, USA"],"raw_orcid":"https://orcid.org/0000-0002-6390-9778","affiliations":[{"raw_affiliation_string":"Florida State University, Tallahassee, USA","institution_ids":["https://openalex.org/I103163165"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027818967","display_name":"Grigory Fedyukovich","orcid":"https://orcid.org/0000-0003-1727-4043"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Grigory Fedyukovich","raw_affiliation_strings":["Florida State University, Tallahassee, USA"],"raw_orcid":"https://orcid.org/0000-0003-1727-4043","affiliations":[{"raw_affiliation_string":"Florida State University, Tallahassee, USA","institution_ids":["https://openalex.org/I103163165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I103163165"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12193062,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"PLDI","first_page":"1814","last_page":"1837"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9997000098228455,"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"}},{"id":"https://openalex.org/T11005","display_name":"Radiation Effects in Electronics","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/precondition","display_name":"Precondition","score":0.857298731803894},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.829373300075531},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7746967673301697},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5408028364181519},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5333101153373718},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.529487669467926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5285657644271851},{"id":"https://openalex.org/keywords/exact-solutions-in-general-relativity","display_name":"Exact solutions in general relativity","score":0.47347795963287354},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.43591535091400146},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.4167788028717041},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3751199543476105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3184715211391449},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1338936984539032},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07615956664085388}],"concepts":[{"id":"https://openalex.org/C192465680","wikidata":"https://www.wikidata.org/wiki/Q1413450","display_name":"Precondition","level":2,"score":0.857298731803894},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.829373300075531},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7746967673301697},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5408028364181519},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5333101153373718},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.529487669467926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5285657644271851},{"id":"https://openalex.org/C520416788","wikidata":"https://www.wikidata.org/wiki/Q5419229","display_name":"Exact solutions in general relativity","level":2,"score":0.47347795963287354},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.43591535091400146},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.4167788028717041},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3751199543476105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3184715211391449},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1338936984539032},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07615956664085388},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3729323","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729323","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3729323","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3729323","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729323","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3729323","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5299999713897705,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G3453156287","display_name":"Collaborative Research: SHF: Medium: Automated Word Level Synthesis for Hardware Code Generation and Verified Abstraction","funder_award_id":"2106949","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411267078.pdf","grobid_xml":"https://content.openalex.org/works/W4411267078.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W110849379","https://openalex.org/W146475325","https://openalex.org/W427023237","https://openalex.org/W1480909796","https://openalex.org/W1498946538","https://openalex.org/W1515621470","https://openalex.org/W1595456961","https://openalex.org/W1848981483","https://openalex.org/W1928820179","https://openalex.org/W2018610026","https://openalex.org/W2036895660","https://openalex.org/W2098022036","https://openalex.org/W2134770942","https://openalex.org/W2149674423","https://openalex.org/W2159756689","https://openalex.org/W2185676247","https://openalex.org/W2267830770","https://openalex.org/W2416392025","https://openalex.org/W2577171054","https://openalex.org/W2598606149","https://openalex.org/W2601986965","https://openalex.org/W2741361950","https://openalex.org/W2765206797","https://openalex.org/W2798609500","https://openalex.org/W2910565741","https://openalex.org/W2911375523","https://openalex.org/W2954725723","https://openalex.org/W2955879452","https://openalex.org/W2962765334","https://openalex.org/W2962858168","https://openalex.org/W2974467477","https://openalex.org/W3004024657","https://openalex.org/W3104841382","https://openalex.org/W3112626473","https://openalex.org/W3139128041","https://openalex.org/W3157346982","https://openalex.org/W3157813120","https://openalex.org/W3173556662","https://openalex.org/W3183759032","https://openalex.org/W4232668957","https://openalex.org/W4298015724","https://openalex.org/W4308644101","https://openalex.org/W4366453422","https://openalex.org/W6949740713"],"related_works":["https://openalex.org/W2028102772","https://openalex.org/W2114366801","https://openalex.org/W4245064363","https://openalex.org/W2139955747","https://openalex.org/W2138154145","https://openalex.org/W2078498437","https://openalex.org/W1836373119","https://openalex.org/W1564871014","https://openalex.org/W4361000813","https://openalex.org/W3168910894"],"abstract_inverted_index":{"There":[0],"are":[1],"many":[2],"state-of-the-art":[3],"techniques":[4],"for":[5,16,43,158],"loop":[6,206],"bound":[7,15,27,42,86,100,116,157],"analysis.":[8],"Most":[9],"of":[10,75,82,103,110,123,148,169,203],"them":[11],"target":[12],"an":[13,40,84,98,155],"upper":[14],"a":[17,23,44,93,111,132,189,201],"given":[18,73],"program,":[19,77],"and":[20,60,193],"others":[21],"find":[22,97],"lower":[24],"bound.":[25],"Exact":[26],"analysis":[28],"still":[29],"remains":[30],"largely":[31],"unexplored,":[32],"but":[33],"it":[34,46,78,197],"offers":[35],"new":[36,94],"applications.":[37],"To":[38],"compute":[39],"exact":[41,85,99,156,179],"program":[45,112,124,135,150],"is":[47,142,154,198],"necessary":[48],"to":[49,64,96,144,167,177],"reason":[50],"about":[51],"the":[52,55,76,80,115,140,145,149,159,163,178],"possible":[53],"values":[54,122,147],"program\u2019s":[56],"inputs":[57,68],"can":[58,69,117],"take":[59],"how":[61],"they":[62],"relate":[63],"each":[65,127],"other.":[66],"Since":[67],"vary":[70],"on":[71,200],"any":[72],"execution":[74],"makes":[79],"problem":[81,166],"computing":[83],"challenging.":[87],"In":[88],"this":[89],"work,":[90],"we":[91,181,194],"present":[92],"approach":[95,130],"by":[101],"way":[102],"precondition":[104,164],"synthesis":[105,165],"which":[106,114,172],"iteratively":[107],"considers":[108],"under-approximations":[109],"under":[113,208],"be":[118],"precomputed":[119],"over":[120,134],"initial":[121,146],"variables.":[125],"For":[126],"precondition,":[128],"our":[129],"synthesizes":[131],"function":[133,141],"variables":[136],"such":[137],"that":[138,168,196],"when":[139],"applied":[143],"variables,":[151],"its":[152,174],"output":[153],"program.":[160],"We":[161],"reduce":[162],"safety":[170],"verification":[171],"lends":[173],"correctness":[175],"guarantees":[176],"bounds":[180],"compute.":[182],"Our":[183],"technique":[184],"has":[185],"been":[186],"implemented":[187],"in":[188],"tool":[190],"called":[191],"ELBA,":[192],"show":[195],"effective":[199],"set":[202],"challenging":[204],"single":[205],"benchmarks":[207],"Linear":[209],"Integer":[210],"Arithmetic.":[211]},"counts_by_year":[],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2025-10-10T00:00:00"}