{"id":"https://openalex.org/W3112178287","doi":"https://doi.org/10.1145/3418583","title":"Interprocedural Context-Unbounded Program Analysis Using Observation Sequences","display_name":"Interprocedural Context-Unbounded Program Analysis Using Observation Sequences","publication_year":2020,"publication_date":"2020-12-07","ids":{"openalex":"https://openalex.org/W3112178287","doi":"https://doi.org/10.1145/3418583","mag":"3112178287"},"language":"en","primary_location":{"id":"doi:10.1145/3418583","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3418583","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3418583","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/3418583","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004774483","display_name":"Peizun Liu","orcid":"https://orcid.org/0000-0002-3583-457X"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peizun Liu","raw_affiliation_strings":["Northeastern University, Boston, MA"],"raw_orcid":"https://orcid.org/0000-0002-3583-457X","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002008766","display_name":"Thomas Wahl","orcid":"https://orcid.org/0000-0003-3643-5463"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Wahl","raw_affiliation_strings":["Northeastern University, Boston, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066155126","display_name":"Thomas Reps","orcid":"https://orcid.org/0000-0002-5676-9949"},"institutions":[{"id":"https://openalex.org/I4210135696","display_name":"GrammaTech (United States)","ror":"https://ror.org/03mwfxd89","country_code":"US","type":"company","lineage":["https://openalex.org/I4210135696"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Reps","raw_affiliation_strings":["University of Wisconsin\u2013Madison and GrammaTech Inc"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin\u2013Madison and GrammaTech Inc","institution_ids":["https://openalex.org/I4210135696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1304,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57271744,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"42","issue":"4","first_page":"1","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9991999864578247,"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/T11424","display_name":"Security and Verification in Computing","score":0.9991999864578247,"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/T10772","display_name":"Distributed systems and fault tolerance","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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8565831184387207},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8484408855438232},{"id":"https://openalex.org/keywords/context-switch","display_name":"Context switch","score":0.636722207069397},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.602107048034668},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5233204364776611},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5115790963172913},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.5063761472702026},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.5040354132652283},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.49354493618011475},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.46849900484085083},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.46796661615371704},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.464141309261322},{"id":"https://openalex.org/keywords/rendezvous","display_name":"Rendezvous","score":0.4539196491241455},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44018465280532837},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.42884063720703125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3615967631340027},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.206557035446167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09908244013786316}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8565831184387207},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8484408855438232},{"id":"https://openalex.org/C53833338","wikidata":"https://www.wikidata.org/wiki/Q1061424","display_name":"Context switch","level":2,"score":0.636722207069397},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.602107048034668},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5233204364776611},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5115790963172913},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.5063761472702026},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5040354132652283},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.49354493618011475},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.46849900484085083},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46796661615371704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.464141309261322},{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.4539196491241455},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44018465280532837},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.42884063720703125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3615967631340027},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.206557035446167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09908244013786316},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C29829512","wikidata":"https://www.wikidata.org/wiki/Q40218","display_name":"Spacecraft","level":2,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3418583","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3418583","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3418583","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"}],"best_oa_location":{"id":"doi:10.1145/3418583","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3418583","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3418583","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":[{"id":"https://metadata.un.org/sdg/8","score":0.4399999976158142,"display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G2575196006","display_name":null,"funder_award_id":"FA8750-14-2-0270","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G394588936","display_name":null,"funder_award_id":"N00014-17-1-2889 and N00014-19-1-2318","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G4504108201","display_name":null,"funder_award_id":"N00014-17-1","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G4577670171","display_name":null,"funder_award_id":"FA8750-15-C-0082","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G4713059963","display_name":null,"funder_award_id":"FA8750","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G5427423732","display_name":null,"funder_award_id":"N00014-19-1-2318","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G698519724","display_name":null,"funder_award_id":"FA8750-14-2-0270","funder_id":"https://openalex.org/F4320338294","funder_display_name":"Air Force Research Laboratory"},{"id":"https://openalex.org/G7470992802","display_name":null,"funder_award_id":"N00014-17-1-2889","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8416410832","display_name":"CAREER: Verifying Threaded Software Using Resource Bounds -- An Approach Towards Dependable Concurrency","funder_award_id":"1253331","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3112178287.pdf","grobid_xml":"https://content.openalex.org/works/W3112178287.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W58916880","https://openalex.org/W1485572331","https://openalex.org/W1493367105","https://openalex.org/W1502963625","https://openalex.org/W1587449012","https://openalex.org/W1598142426","https://openalex.org/W1603445208","https://openalex.org/W1691700263","https://openalex.org/W1840677318","https://openalex.org/W1905205673","https://openalex.org/W1911833263","https://openalex.org/W1933255669","https://openalex.org/W1976967219","https://openalex.org/W2043100293","https://openalex.org/W2060345611","https://openalex.org/W2061751777","https://openalex.org/W2087046173","https://openalex.org/W2100532597","https://openalex.org/W2101161997","https://openalex.org/W2107398710","https://openalex.org/W2117842469","https://openalex.org/W2128453996","https://openalex.org/W2131886132","https://openalex.org/W2143502475","https://openalex.org/W2148778089","https://openalex.org/W2164496154","https://openalex.org/W2427037371","https://openalex.org/W2431458507","https://openalex.org/W2485615711","https://openalex.org/W2508346251","https://openalex.org/W2514073783","https://openalex.org/W2798442694","https://openalex.org/W2960694955","https://openalex.org/W3011399235","https://openalex.org/W4230480080","https://openalex.org/W4247858957","https://openalex.org/W4301322018","https://openalex.org/W4301467326","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W103515806","https://openalex.org/W3037629344","https://openalex.org/W4288079317","https://openalex.org/W3104883141","https://openalex.org/W2997159042","https://openalex.org/W4299898478","https://openalex.org/W1602322980","https://openalex.org/W2797371396","https://openalex.org/W3011686562","https://openalex.org/W3112178287"],"abstract_inverted_index":{"A":[0,21],"classical":[1],"result":[2,180],"by":[3,24,233],"Ramalingam":[4],"about":[5],"synchronization-sensitive":[6],"interprocedural":[7,185],"program":[8,164],"analysis":[9,165,187],"implies":[10],"that":[11,44,126,148],"reachability":[12,114,186],"for":[13,100,152,189,208],"concurrent":[14,190],"threads":[15],"running":[16],"recursive":[17],"procedures":[18],"is":[19,123,181,199],"undecidable.":[20],"technique":[22,67,188,194,219],"proposed":[23],"Qadeer":[25],"and":[26,204,215],"Rehof,":[27],"to":[28,40,48,57,124,146,160,170,201],"bound":[29],"the":[30,37,66,71,93,109,113,137,149,161,168,172,213,218],"number":[31,173],"of":[32,64,73,97,115,174,217,223],"context":[33,177],"switches":[34],"allowed":[35],"between":[36],"threads,":[38],"leads":[39],"an":[41],"incomplete":[42],"solution":[43],"is,":[45],"however,":[46],"believed":[47],"catch":[49],"\u201cmost":[50],"bugs\u201d":[51],"in":[52,77,90],"practice,":[53],"as":[54],"errors":[55],"tend":[56],"occur":[58],"within":[59],"few":[60],"contexts.":[61],"The":[62,121,179,226],"question":[63],"whether":[65],"can":[68],"also":[69],"prove":[70,205],"absence":[72],"bugs":[74],"at":[75],"least":[76],"some":[78,129],"cases":[79],"has":[80,140],"remained":[81],"largely":[82],"open.":[83],"Toward":[84],"closing":[85],"this":[86,91,158],"gap,":[87],"we":[88],"introduce":[89],"article":[92],"generic":[94],"verification":[95],"paradigm":[96,159],"observation":[98],"sequences":[99],"resource-parameterized":[101],"programs.":[102,192,210,225],"Such":[103],"a":[104,118,182,221],"sequence":[105,139],"observes":[106],"how":[107],"increasing":[108],"resource":[110,169],"parameter":[111,131,154],"affects":[112],"states":[116],"satisfying":[117],"given":[119],"property.":[120],"goal":[122],"show":[125],"increases":[127],"beyond":[128],"\u201ccutoff\u201d":[130],"value":[132],"have":[133],"no":[134],"impact":[135],"on":[136],"reachability\u2014the":[138],"converged":[141],".":[142],"This":[143],"allows":[144],"us":[145],"conclude":[147],"property":[150],"holds":[151],"all":[153],"values.":[155],"We":[156,211],"applied":[157],"context-":[162],"unbounded":[163],"problem,":[166],"choosing":[167],"be":[171,230],"permitted":[175],"thread":[176],"switches.":[178],"partially":[183],"correct":[184],"shared-memory":[191],"Our":[193],"may":[195],"not":[196],"terminate":[197],"but":[198],"able":[200],"both":[202],"refute":[203],"context-unbounded":[206],"safety":[207],"such":[209],"demonstrate":[212],"effectiveness":[214],"efficiency":[216],"using":[220],"variety":[222],"benchmark":[224],"safe":[227,232],"instances":[228],"cannot":[229],"proved":[231],"earlier,":[234],"context-bounded":[235],"methods.":[236]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}