{"id":"https://openalex.org/W3009765366","doi":"https://doi.org/10.1145/1543135.1542518","title":"Control-flow refinement and progress invariants for bound analysis","display_name":"Control-flow refinement and progress invariants for bound analysis","alternate_titles":[],"publication_year":2009,"publication_date":"2009-05-28","ids":{"openalex":"https://openalex.org/W3009765366","doi":"https://doi.org/10.1145/1543135.1542518","mag":"3009765366"},"language":"en","primary_location":{"id":"doi:10.1145/1543135.1542518","doi":"https://doi.org/10.1145/1543135.1542518","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1543135.1542518","pdf_url":null,"source":{"id":"https://openalex.org/S148324379","display_name":"ACM SIGPLAN Notices","issn_l":"0362-1340","issn":["0362-1340","1558-1160"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGPLAN Notices","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W3009765366"],"child_works_count":0,"type":"article","is_traditional":true,"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","observed_orcids":["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, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112130921","display_name":"Sagar C. Jain","orcid":"https://orcid.org/0009-0001-0296-3092","observed_orcids":["https://orcid.org/0009-0001-0296-3092"]},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sagar Jain","raw_affiliation_strings":["IIT Kanpur, Kanpur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Kanpur, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024796518","display_name":"Eric Koskinen","orcid":"https://orcid.org/0000-0001-7363-634X","observed_orcids":["https://orcid.org/0000-0001-7363-634X"]},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Eric Koskinen","raw_affiliation_strings":["University of Cambridge, Cambridge, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9216,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.90478145,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":"44","issue":"6","first_page":"375","last_page":"385"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9800000190734863,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9800000190734863,"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/T10142","display_name":"Formal Methods in Verification","score":0.0066999997943639755,"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.005100000184029341,"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/nested-loops","display_name":"nested loops","score":0.9639999866485596},{"id":"https://openalex.org/keywords/loop-termination","display_name":"loop termination","score":0.48899999260902405}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8023662567138672},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.6439304351806641},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.5643484592437744},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.5434575080871582},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5193166136741638},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.5058450698852539},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.495220810174942},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.4901729226112366},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4774535298347473},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.4658530354499817},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4650996923446655},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4573459327220917},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.448564738035202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4151774048805237},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.37213146686553955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17635276913642883},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.1603682041168213},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.15689247846603394},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.13973385095596313},{"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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1543135.1542518","doi":"https://doi.org/10.1145/1543135.1542518","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1543135.1542518","pdf_url":null,"source":{"id":"https://openalex.org/S148324379","display_name":"ACM SIGPLAN Notices","issn_l":"0362-1340","issn":["0362-1340","1558-1160"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGPLAN Notices","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1492171827","https://openalex.org/W1502028089","https://openalex.org/W1553630057","https://openalex.org/W1563352283","https://openalex.org/W1570919259","https://openalex.org/W1797762004","https://openalex.org/W1987142766","https://openalex.org/W2066550846","https://openalex.org/W2076285066","https://openalex.org/W2107588378","https://openalex.org/W2107794009","https://openalex.org/W2109863363","https://openalex.org/W2132661148","https://openalex.org/W2293708017","https://openalex.org/W2295903414","https://openalex.org/W2911436048","https://openalex.org/W3158747708","https://openalex.org/W4232668957","https://openalex.org/W4241086578","https://openalex.org/W4250347244"],"related_works":["https://openalex.org/W50684811","https://openalex.org/W7100965661","https://openalex.org/W2123436474","https://openalex.org/W174361986","https://openalex.org/W4240835555","https://openalex.org/W66240089","https://openalex.org/W2027056086","https://openalex.org/W2137860916","https://openalex.org/W2109863363","https://openalex.org/W2910234115"],"abstract_inverted_index":{"Symbolic":[0],"complexity":[1],"bounds":[2,19,58,140,197],"help":[3],"programmers":[4],"understand":[5],"the":[6,83,201],"performance":[7],"characteristics":[8],"of":[9,20,56,85,146,163,184,186,200,207],"their":[10],"implementations.":[11],"Existing":[12],"work":[13],"provides":[14],"techniques":[15,108,149],"for":[16,59,105,141,198],"statically":[17],"determining":[18],"procedures":[21,26,60,104],"with":[22,27,61,78],"simple":[23],"control-flow.":[24],"However,":[25],"nested":[28,62,142],"loops":[29,80],"or":[30],"multiple":[31],"paths":[32],"through":[33],"a":[34,69,73,100,125,187,216,220],"single":[35],"loop":[36,71],"are":[37,204],"challenging.":[38],"In":[39,158],"this":[40,92],"paper":[41],"we":[42,160],"describe":[43],"two":[44,148],"techniques,":[45],"control-flow":[46,164],"refinement":[47,67,165],"and":[48,63,191],"progress":[49,135],"invariants":[50,115,136],",":[51],"that":[52,91,121,133,170,212],"together":[53],"enable":[54],"estimation":[55],"precise":[57,139],"multi-path":[64,70],"loops.":[65,143,202],"Control-flow":[66],"transforms":[68],"into":[72],"semantically":[74],"equivalent":[75],"code":[76,185],"fragment":[77],"simpler":[79],"by":[81],"making":[82],"structure":[84],"path":[86],"interleaving":[87],"explicit.":[88],"We":[89,128,175,203],"show":[90],"enables":[93],"non-disjunctive":[94],"invariant":[95],"generation":[96],"tools":[97],"to":[98,111,137,154,166,180,194],"find":[99,195],"bound":[101,156,217],"on":[102,219],"many":[103],"which":[106],"previous":[107],"were":[109,192],"unable":[110],"prove":[112],"termination.":[113],"Progress":[114],"characterize":[116],"relationships":[117],"between":[118],"consecutive":[119],"states":[120],"can":[122],"arise":[123],"at":[124],"program":[126],"location.":[127],"further":[129],"present":[130],"an":[131],"algorithm":[132],"uses":[134],"compute":[138],"The":[144],"utility":[145],"these":[147],"goes":[150],"beyond":[151],"our":[152,178],"application":[153],"symbolic":[155,196],"analysis.":[157],"particular,":[159],"discuss":[161],"applications":[162],"proving":[167],"safety":[168],"properties":[169],"otherwise":[171],"require":[172],"disjunctive":[173],"invariants.":[174],"have":[176],"applied":[177],"methodology":[179],"over":[181],"670,000":[182],"lines":[183],"significant":[188],"Microsoft":[189],"product":[190],"able":[193],"90%":[199],"not":[205],"aware":[206],"any":[208],"other":[209],"published":[210],"results":[211],"report":[213],"experiences":[214],"running":[215],"analysis":[218],"real":[221],"code-base.":[222]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3009765366","counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2020-03-13T00:00:00"}
