{"id":"https://openalex.org/W4220670822","doi":"https://doi.org/10.1145/3497776.3517782","title":"On the computation of interprocedural weak control closure","display_name":"On the computation of interprocedural weak control closure","publication_year":2022,"publication_date":"2022-03-18","ids":{"openalex":"https://openalex.org/W4220670822","doi":"https://doi.org/10.1145/3497776.3517782"},"language":"en","primary_location":{"id":"doi:10.1145/3497776.3517782","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3497776.3517782","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 International Conference on Compiler Construction","raw_type":"proceedings-article"},"type":"article","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/A5091315577","display_name":"Abu Naser Masud","orcid":"https://orcid.org/0000-0002-4872-1208"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Abu Naser Masud","raw_affiliation_strings":["M\u00e4lardalen University, Sweden"],"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen University, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062612658","display_name":"Bj\u00f6rn Lisper","orcid":"https://orcid.org/0000-0001-5297-6548"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bj\u00f6rn Lisper","raw_affiliation_strings":["M\u00e4lardalen University, Sweden"],"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen University, Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091315577"],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":0.3979,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64998342,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"76"},"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.9997000098228455,"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.9997000098228455,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9988999962806702,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9976000189781189,"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/soundness","display_name":"Soundness","score":0.912825345993042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8444247245788574},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6779093742370605},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6266225576400757},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.592130720615387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46923714876174927},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4576205015182495},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4304659962654114},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.4222482442855835}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.912825345993042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8444247245788574},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6779093742370605},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6266225576400757},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.592130720615387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46923714876174927},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4576205015182495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4304659962654114},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.4222482442855835},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3497776.3517782","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3497776.3517782","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 International Conference on Compiler Construction","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":20,"referenced_works":["https://openalex.org/W615016617","https://openalex.org/W1933821928","https://openalex.org/W1992792191","https://openalex.org/W2008059658","https://openalex.org/W2034103799","https://openalex.org/W2060389212","https://openalex.org/W2076807040","https://openalex.org/W2096491586","https://openalex.org/W2129278597","https://openalex.org/W2135988257","https://openalex.org/W2144344516","https://openalex.org/W2152565800","https://openalex.org/W2169063818","https://openalex.org/W2640365788","https://openalex.org/W2796162251","https://openalex.org/W2796645376","https://openalex.org/W3119538636","https://openalex.org/W3119864243","https://openalex.org/W3213998573","https://openalex.org/W4250956278"],"related_works":["https://openalex.org/W2045049461","https://openalex.org/W1978893398","https://openalex.org/W2201908702","https://openalex.org/W4381094582","https://openalex.org/W1511249877","https://openalex.org/W2369625323","https://openalex.org/W2364579609","https://openalex.org/W1977906818","https://openalex.org/W1578828174","https://openalex.org/W2867457158"],"abstract_inverted_index":{"Many":[0],"program":[1,169],"analysis":[2],"techniques":[3],"depend":[4],"on":[5,98,126,146],"capturing":[6,78],"the":[7,11,64,73,79,93,99,106,142],"control":[8,15,21,27,40,48,84,130],"dependencies":[9,22],"of":[10,68,82,95,102,109,165],"program.":[12],"Most":[13],"existing":[14],"dependence":[16,28,49,131],"algorithms":[17],"either":[18],"compute":[19,26,72],"intraprocedural":[20],"only,":[23],"or":[24],"they":[25],"relations":[29],"that":[30,53,155],"are":[31,54,112],"not":[32],"precise":[33],"in":[34],"general":[35],"including":[36,51],"nonterminating":[37,57],"systems.":[38,58],"Weak":[39],"closure":[41],"(WCC)":[42],"subsumes":[43],"all":[44,147],"known":[45],"nontermination":[46],"insensitive":[47],"relations,":[50],"those":[52],"appropriate":[55],"for":[56,75,161],"In":[59],"this":[60],"paper,":[61],"we":[62,140],"provide":[63],"first":[65],"formal":[66],"development":[67],"an":[69],"algorithm":[70,119,124,136,157],"to":[71,92],"WCC":[74,122,166],"interprocedural":[76,83,129,168],"programs":[77],"weak":[80],"form":[81],"dependencies.":[85],"The":[86,134],"method":[87,111],"is":[88,158],"widely":[89],"applicable":[90],"due":[91],"generality":[94],"WCC.":[96],"Theorems":[97],"theoretical":[100],"results":[101],"soundness,":[103,138],"precision,":[104],"and":[105,139],"worst-case":[107],"complexity":[108],"our":[110,118,148,156],"also":[113],"included.":[114],"We":[115],"have":[116],"compared":[117],"with":[120],"a":[121,127],"computation":[123,132],"based":[125],"state-of-the-art":[128],"algorithm.":[133],"latter":[135],"loses":[137],"improve":[141],"precision":[143],"by":[144],"15.21%":[145],"experimental":[149],"benchmarks.":[150],"This":[151],"empirical":[152],"evidence":[153],"suggests":[154],"more":[159],"effective":[160],"any":[162],"client":[163],"application":[164],"requiring":[167],"analysis.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}