{"id":"https://openalex.org/W2184209356","doi":"https://doi.org/10.1145/1190216.1190266","title":"Interprocedural analysis of asynchronous programs","display_name":"Interprocedural analysis of asynchronous programs","publication_year":2007,"publication_date":"2007-01-17","ids":{"openalex":"https://openalex.org/W2184209356","doi":"https://doi.org/10.1145/1190216.1190266","mag":"2184209356"},"language":"en","primary_location":{"id":"doi:10.1145/1190216.1190266","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1190216.1190266","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","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/A5002412544","display_name":"Ranjit Jhala","orcid":"https://orcid.org/0000-0002-1802-9421"},"institutions":[{"id":"https://openalex.org/I2800935791","display_name":"UC San Diego Health System","ror":"https://ror.org/01kbfgm16","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I2800935791"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ranjit Jhala","raw_affiliation_strings":["UC San Diego"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC San Diego","institution_ids":["https://openalex.org/I2800935791"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081010207","display_name":"Rupak Majumdar","orcid":"https://orcid.org/0000-0003-2136-0542"},"institutions":[{"id":"https://openalex.org/I4210139270","display_name":"UtopiaCompression (United States)","ror":"https://ror.org/051d4q284","country_code":"US","type":"company","lineage":["https://openalex.org/I4210139270"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rupak Majumdar","raw_affiliation_strings":["UC Los Angeles"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC Los Angeles","institution_ids":["https://openalex.org/I4210139270"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2907,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.93485114,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"339","last_page":"350"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9995999932289124,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.9694592952728271},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8980196714401245},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7460074424743652},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5527151226997375},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5486758351325989},{"id":"https://openalex.org/keywords/data-flow-analysis","display_name":"Data-flow analysis","score":0.5030931830406189},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.447360098361969},{"id":"https://openalex.org/keywords/dataflow-architecture","display_name":"Dataflow architecture","score":0.4138849675655365},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.357234388589859},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.20360001921653748}],"concepts":[{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.9694592952728271},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8980196714401245},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7460074424743652},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5527151226997375},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5486758351325989},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.5030931830406189},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.447360098361969},{"id":"https://openalex.org/C176727019","wikidata":"https://www.wikidata.org/wiki/Q1172415","display_name":"Dataflow architecture","level":3,"score":0.4138849675655365},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.357234388589859},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.20360001921653748},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1190216.1190266","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1190216.1190266","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W17837200","https://openalex.org/W24619462","https://openalex.org/W1497571013","https://openalex.org/W1563374799","https://openalex.org/W1598283981","https://openalex.org/W1763049863","https://openalex.org/W1855789069","https://openalex.org/W1971903460","https://openalex.org/W2010365467","https://openalex.org/W2042876806","https://openalex.org/W2060345611","https://openalex.org/W2080573945","https://openalex.org/W2082000355","https://openalex.org/W2088139180","https://openalex.org/W2103953153","https://openalex.org/W2108204150","https://openalex.org/W2116519336","https://openalex.org/W2119964141","https://openalex.org/W2123910665","https://openalex.org/W2148620466","https://openalex.org/W2151463894","https://openalex.org/W2157390113","https://openalex.org/W2158395308","https://openalex.org/W2169611673","https://openalex.org/W2295903414","https://openalex.org/W2316437449","https://openalex.org/W4210597212","https://openalex.org/W4212792638","https://openalex.org/W4242949098","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2032571270","https://openalex.org/W1488303959","https://openalex.org/W2069952017","https://openalex.org/W1533244915","https://openalex.org/W2471130673","https://openalex.org/W2388145752","https://openalex.org/W2140468016","https://openalex.org/W2243710416","https://openalex.org/W1512554843","https://openalex.org/W2403596187"],"abstract_inverted_index":{"An":[0],"asynchronous":[1,42,117],"program":[2],"is":[3,126],"one":[4],"that":[5,130],"contains":[6],"procedure":[7],"calls":[8],"which":[9],"are":[10],"not":[11],"immediately":[12],"executed":[13],"from":[14],"the":[15,35,50,63,79,102,110,120],"callsite,":[16],"but":[17],"stored":[18],"and":[19],"\u201cdispatched\u201d":[20],"in":[21,131],"a":[22,30,47,74],"non-deterministic":[23],"order":[24],"by":[25,139],"an":[26,59],"external":[27],"scheduler":[28],"at":[29],"later":[31],"point.":[32],"We":[33,57,99],"formalize":[34],"problem":[36,121],"of":[37,49,92,106,122,143],"interprocedural":[38,54,95,144],"dataflow":[39,55,96,145],"analysis":[40,97],"for":[41,53,61,67,77,115],"programs":[43,138],"as":[44,71,73],"AIFDS":[45,69,82,124],"problems,":[46],"generalization":[48],"IFDS":[51],"problems":[52],"analysis.":[56],"give":[58],"algorithm":[60,76,85,103],"computing":[62],"precise":[64],"meet-over-valid-paths":[65],"solution":[66],"any":[68,93],"instance,":[70],"well":[72],"demand-driven":[75],"solving":[78,123],"corresponding":[80],"demand":[81],"instances.":[83],"Our":[84],"can":[86,135],"be":[87],"easily":[88],"implemented":[89,101],"on":[90,104],"top":[91,105],"existing":[94],"framework.":[98],"have":[100],"BLAST,":[107],"thereby":[108],"obtaining":[109],"first":[111],"safety":[112],"verification":[113],"tool":[114],"unbounded":[116],"programs.":[118],"Though":[119],"instances":[125],"EXPSPACE-hard,":[127],"we":[128],"find":[129],"practice":[132],"our":[133],"technique":[134],"efficiently":[136],"analyze":[137],"exploiting":[140],"standard":[141],"optimizations":[142],"analyses.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}