{"id":"https://openalex.org/W2122917953","doi":"https://doi.org/10.1145/1806596.1806630","title":"The reachability-bound problem","display_name":"The reachability-bound problem","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2122917953","doi":"https://doi.org/10.1145/1806596.1806630","mag":"2122917953"},"language":"en","primary_location":{"id":"doi:10.1145/1806596.1806630","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806596.1806630","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011543162","display_name":"Sumit Gulwani","orcid":"https://orcid.org/0000-0002-9226-9634"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sumit Gulwani","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063337176","display_name":"Florian Zuleger","orcid":"https://orcid.org/0000-0003-1468-8398"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Florian Zuleger","raw_affiliation_strings":["TU Vienna, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":14.0889,"has_fulltext":false,"cited_by_count":116,"citation_normalized_percentile":{"value":0.99601085,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"292","last_page":"304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T11424","display_name":"Security and Verification in Computing","score":0.9991000294685364,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.952391505241394},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.8511725068092346},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.691652774810791},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6372552514076233},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5794055461883545},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.573334813117981},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4921690821647644},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4677588641643524},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4448111057281494},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.437372624874115},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.42173394560813904},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3369101285934448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2590333819389343},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10758528113365173},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.09612336754798889}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.952391505241394},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.8511725068092346},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.691652774810791},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6372552514076233},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5794055461883545},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.573334813117981},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4921690821647644},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4677588641643524},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4448111057281494},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.437372624874115},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.42173394560813904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3369101285934448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2590333819389343},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10758528113365173},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09612336754798889},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1806596.1806630","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806596.1806630","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.179.3091","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.179.3091","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.microsoft.com/users/sumitg/pubs/pldi10_speed.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.541.9041","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.541.9041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/pubs/104919/msr-tr-2009-146.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W66240089","https://openalex.org/W1492171827","https://openalex.org/W1530375435","https://openalex.org/W1530458829","https://openalex.org/W1535183500","https://openalex.org/W1541144457","https://openalex.org/W1563352283","https://openalex.org/W1568984608","https://openalex.org/W1584436405","https://openalex.org/W1604476105","https://openalex.org/W1844529821","https://openalex.org/W2043100293","https://openalex.org/W2066550846","https://openalex.org/W2076285066","https://openalex.org/W2078114603","https://openalex.org/W2107588378","https://openalex.org/W2109863363","https://openalex.org/W2112969535","https://openalex.org/W2114067856","https://openalex.org/W2124909257","https://openalex.org/W2129883154","https://openalex.org/W2131275552","https://openalex.org/W2132661148","https://openalex.org/W2135331739","https://openalex.org/W2139401046","https://openalex.org/W2142481893","https://openalex.org/W2159756689","https://openalex.org/W2293708017","https://openalex.org/W2294635730","https://openalex.org/W2911436048","https://openalex.org/W2987077139","https://openalex.org/W4232668957","https://openalex.org/W4238789074","https://openalex.org/W4241086578"],"related_works":["https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W4224983736","https://openalex.org/W2060144422","https://openalex.org/W2011495892","https://openalex.org/W4389158950"],"abstract_inverted_index":{"We":[0],"define":[1],"the":[2,7,16,32,79,130,141],"reachability-bound":[3,80],"problem":[4,8,81],"to":[5,34,61,77,146],"be":[6],"of":[9,18,31,64,96,132,143],"finding":[10],"a":[11,20,25,45,118],"symbolic":[12],"worst-case":[13],"bound":[14,125],"on":[15],"number":[17],"times":[19],"given":[21],"control":[22],"location":[23],"inside":[24],"procedure":[26],"is":[27,99,117],"visited":[28],"in":[29,40,66,91],"terms":[30],"inputs":[33],"that":[35,127],"procedure.":[36],"This":[37],"has":[38],"applications":[39],"bounding":[41],"resources":[42],"consumed":[43],"by":[44],"program":[46],"such":[47,68],"as":[48,53,55,69],"time,":[49],"memory,":[50],"network-traffic,":[51],"power,":[52],"well":[54],"estimating":[56],"quantitative":[57],"properties":[58],"(as":[59],"opposed":[60],"boolean":[62],"properties)":[63],"data":[65],"programs,":[67],"information":[70],"leakage":[71],"or":[72],"uncertainty":[73],"propagation.":[74],"Our":[75],"approach":[76],"solving":[78],"brings":[82],"together":[83],"two":[84],"different":[85],"techniques":[86,98],"for":[87,105],"reasoning":[88],"about":[89,148],"loops":[90],"an":[92,100],"effective":[93],"manner.":[94],"One":[95],"these":[97],"abstract-interpretation":[101],"based":[102,121],"iterative":[103],"technique":[104,116,122],"computing":[106],"precise":[107],"disjunctive":[108],"invariants":[109],"(to":[110],"summarize":[111],"nested":[112],"loops).":[113],"The":[114],"other":[115],"non-iterative":[119],"proof-rules":[120],"(for":[123],"loop":[124],"computation)":[126],"takes":[128],"over":[129],"role":[131],"doing":[133],"inductive":[134],"reasoning,":[135],"while":[136],"deriving":[137],"its":[138],"power":[139],"from":[140],"use":[142],"SMT":[144],"solvers":[145],"reason":[147],"abstract":[149],"loop-free":[150],"fragments.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":13}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}