{"id":"https://openalex.org/W1992234860","doi":"https://doi.org/10.1145/1286821.1286829","title":"An improved bound for call strings based interprocedural analysis of bit vector frameworks","display_name":"An improved bound for call strings based interprocedural analysis of bit vector frameworks","publication_year":2007,"publication_date":"2007-10-01","ids":{"openalex":"https://openalex.org/W1992234860","doi":"https://doi.org/10.1145/1286821.1286829","mag":"1992234860"},"language":"en","primary_location":{"id":"doi:10.1145/1286821.1286829","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1286821.1286829","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1286821.1286829","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1286821.1286829","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007475982","display_name":"Bageshri Karkare","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Bageshri Karkare","raw_affiliation_strings":["IIT Bombay","IIT-Bombay"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Bombay","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"IIT-Bombay","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030116244","display_name":"Uday P. Khedker","orcid":"https://orcid.org/0000-0002-5203-4494"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Uday P. Khedker","raw_affiliation_strings":["IIT Bombay","IIT-Bombay"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Bombay","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"IIT-Bombay","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":2.3267,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88796459,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"6","first_page":"38","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.7896555066108704},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5124383568763733},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.47890082001686096},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.4656088650226593},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45125612616539},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4431915879249573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4046871066093445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10085359215736389},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08700069785118103}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7896555066108704},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5124383568763733},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.47890082001686096},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4656088650226593},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45125612616539},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4431915879249573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4046871066093445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10085359215736389},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08700069785118103},{"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1286821.1286829","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1286821.1286829","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1286821.1286829","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},{"id":"pmh:oai:dsapce.library.iitb.ac.in:10054/5047","is_oa":false,"landing_page_url":"http://dspace.library.iitb.ac.in/xmlui/handle/10054/5047","pdf_url":null,"source":{"id":"https://openalex.org/S4306400899","display_name":"DSpace (IIT Bombay)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162827531","host_organization_name":"Indian Institute of Technology Bombay","host_organization_lineage":["https://openalex.org/I162827531"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:dspace.library.iitb.ac.in:10054/5047","is_oa":false,"landing_page_url":"http://doi.org/10.1145/1286821.1286829","pdf_url":null,"source":{"id":"https://openalex.org/S4306400899","display_name":"DSpace (IIT Bombay)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162827531","host_organization_name":"Indian Institute of Technology Bombay","host_organization_lineage":["https://openalex.org/I162827531"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1145/1286821.1286829","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1286821.1286829","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1286821.1286829","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1992234860.pdf","grobid_xml":"https://content.openalex.org/works/W1992234860.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W62419442","https://openalex.org/W148396834","https://openalex.org/W1491178396","https://openalex.org/W1503265404","https://openalex.org/W1934562588","https://openalex.org/W1974909417","https://openalex.org/W1991158186","https://openalex.org/W2043626706","https://openalex.org/W2053152889","https://openalex.org/W2080573945","https://openalex.org/W2088017390","https://openalex.org/W2114067856","https://openalex.org/W2124153277","https://openalex.org/W2143659699","https://openalex.org/W2151360539","https://openalex.org/W2158600037","https://openalex.org/W4242680074","https://openalex.org/W4298132153"],"related_works":["https://openalex.org/W2132137594","https://openalex.org/W2069783012","https://openalex.org/W2085967955","https://openalex.org/W4256335355","https://openalex.org/W3098612666","https://openalex.org/W1499116563","https://openalex.org/W2138867060","https://openalex.org/W2023859141","https://openalex.org/W2182290077","https://openalex.org/W4206067440"],"abstract_inverted_index":{"Interprocedural":[0],"data":[1,43,67,113],"flow":[2,28,44,68,114],"analysis":[3,8,115,224],"extends":[4],"the":[5,42,47,93,106,117,125,131,138,153,180,213,216,223],"scope":[6],"of":[7,14,38,49,55,83,96,108,119,129,133,140,142,185,218],"across":[9],"procedure":[10],"boundaries":[11],"in":[12,46,100,111,146,156,179],"search":[13],"increased":[15],"optimization":[16],"opportunities.":[17],"Call":[18],"strings":[19,64,82,155,195],"based":[20],"approach":[21,25],"is":[22,76,92],"a":[23,36,147,158],"general":[24],"for":[26,65,168],"performing":[27],"and":[29,215,221],"context":[30],"sensitive":[31],"interprocedural":[32,66,171],"analysis.":[33,69],"It":[34],"maintains":[35],"history":[37],"calls":[39],"along":[40],"with":[41,116],"information":[45,109],"form":[48],"call":[50,63,81,98,102,126,134,144,148,154,159,186,194,219],"strings,":[51,135,187,220],"which":[52,157],"are":[53,166],"sequences":[54],"unfinished":[56],"calls.":[57],"Recursive":[58],"programs":[59,207],"may":[60],"need":[61],"infinite":[62],"For":[70],"bit":[71],"vector":[72],"frameworks":[73],"this":[74,177],"method":[75],"believed":[77],"to":[78,86,123,197],"require":[79,191],"all":[80,193],"lengths":[84,214],"up":[85,196],"3":[87,199],"K":[88,91,200],",":[89],"where":[90],"maximum":[94,172],"number":[95,139,217],"distinct":[97],"sites":[99],"any":[101,143],"chain.":[103],"We":[104,150],"combine":[105],"nature":[107],"flows":[110],"bit-vector":[112],"structure":[118],"interprocedurally":[120],"valid":[121],"paths":[122],"bound":[124,137,211],"strings.":[127],"Instead":[128],"bounding":[130],"length":[132,184,198],"we":[136],"occurrences":[141],"site":[145,160],"string.":[149],"show":[151,208],"that":[152,209],"appears":[161],"at":[162],"most":[163],"three":[164],"times,":[165],"sufficient":[167],"convergence":[169],"on":[170,205],"fixed":[173],"point":[174],"solution.":[175],"Though":[176],"results":[178],"same":[181],"worst":[182],"case":[183],"it":[188],"does":[189],"not":[190],"constructing":[192],".":[201],"Our":[202],"empirical":[203],"measurements":[204],"recursive":[206],"our":[210],"reduces":[212],"hence":[222],"time,":[225],"significantly.":[226]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
