{"id":"https://openalex.org/W3119538636","doi":"https://doi.org/10.1145/3434489","title":"Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs","display_name":"Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs","publication_year":2020,"publication_date":"2020-12-31","ids":{"openalex":"https://openalex.org/W3119538636","doi":"https://doi.org/10.1145/3434489","mag":"3119538636"},"language":"en","primary_location":{"id":"doi:10.1145/3434489","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434489","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434489","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/3434489","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":false,"raw_author_name":"Abu Naser Masud","raw_affiliation_strings":["M\u00e4lardalen University, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-4872-1208","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"],"raw_orcid":"https://orcid.org/0000-0001-5297-6548","affiliations":[{"raw_affiliation_string":"M\u00e4lardalen University, Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":1.4913,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.83649526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"42","issue":"4","first_page":"1","last_page":"56"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998999834060669,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998999834060669,"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/T10260","display_name":"Software Engineering Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9980000257492065,"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/program-slicing","display_name":"Program slicing","score":0.8824628591537476},{"id":"https://openalex.org/keywords/slicing","display_name":"Slicing","score":0.8710371255874634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8596655130386353},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7941961288452148},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7461583018302917},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6740162968635559},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6186982989311218},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5750432014465332},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.518707811832428},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.41777849197387695},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3681170642375946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3624688386917114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10934847593307495}],"concepts":[{"id":"https://openalex.org/C91071405","wikidata":"https://www.wikidata.org/wiki/Q1413145","display_name":"Program slicing","level":3,"score":0.8824628591537476},{"id":"https://openalex.org/C2776190703","wikidata":"https://www.wikidata.org/wiki/Q488148","display_name":"Slicing","level":2,"score":0.8710371255874634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8596655130386353},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7941961288452148},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7461583018302917},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6740162968635559},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6186982989311218},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5750432014465332},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.518707811832428},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.41777849197387695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3681170642375946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3624688386917114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10934847593307495},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3434489","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434489","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434489","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/3434489","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434489","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434489","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3119538636.pdf","grobid_xml":"https://content.openalex.org/works/W3119538636.grobid-xml"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W53653091","https://openalex.org/W166717638","https://openalex.org/W615016617","https://openalex.org/W1506151672","https://openalex.org/W1527392356","https://openalex.org/W1578662211","https://openalex.org/W1966503837","https://openalex.org/W1988503504","https://openalex.org/W1992792191","https://openalex.org/W2006802414","https://openalex.org/W2008059658","https://openalex.org/W2023738761","https://openalex.org/W2030309884","https://openalex.org/W2034103799","https://openalex.org/W2043100293","https://openalex.org/W2047854842","https://openalex.org/W2060389212","https://openalex.org/W2068839502","https://openalex.org/W2076807040","https://openalex.org/W2079083905","https://openalex.org/W2080573945","https://openalex.org/W2080973181","https://openalex.org/W2083582440","https://openalex.org/W2092483417","https://openalex.org/W2100420477","https://openalex.org/W2108750355","https://openalex.org/W2132897705","https://openalex.org/W2135988257","https://openalex.org/W2144344516","https://openalex.org/W2147082313","https://openalex.org/W2147088720","https://openalex.org/W2151111302","https://openalex.org/W2152565800","https://openalex.org/W2157402204","https://openalex.org/W2157820337","https://openalex.org/W2160578811","https://openalex.org/W2160660801","https://openalex.org/W2169063818","https://openalex.org/W2293624369","https://openalex.org/W2401455848","https://openalex.org/W2469868625","https://openalex.org/W2530894209","https://openalex.org/W2604929704","https://openalex.org/W2794764722","https://openalex.org/W2913256667","https://openalex.org/W3199824772","https://openalex.org/W4238906855","https://openalex.org/W4241211222","https://openalex.org/W4247632680","https://openalex.org/W4250786511","https://openalex.org/W4252041214","https://openalex.org/W4299128485"],"related_works":["https://openalex.org/W2134982133","https://openalex.org/W1964336761","https://openalex.org/W4239953224","https://openalex.org/W2011854888","https://openalex.org/W1595405651","https://openalex.org/W2347708239","https://openalex.org/W4302024603","https://openalex.org/W4307816711","https://openalex.org/W2034103799","https://openalex.org/W2053408591"],"abstract_inverted_index":{"Existing":[0],"proofs":[1],"of":[2,14,37,74,110,119,148],"correctness":[3,38],"for":[4,39,54,106],"dependence-based":[5,40],"slicing":[6,13,28,41],"methods":[7,42],"are":[8,70],"limited":[9],"either":[10],"to":[11,25],"the":[12,20,71,75,98,145,149],"intraprocedural":[15],"programs":[16],"[2,":[17],"39],":[18],"or":[19,48],"proof":[21,36,60,102],"is":[22,104],"only":[23],"applicable":[24],"a":[26,34,107,117],"specific":[27],"method":[29],"[4,":[30],"41].":[31],"We":[32,114,124],"contribute":[33],"general":[35],"such":[43],"as":[44],"Weiser":[45,131],"[50,":[46],"51],":[47],"Binkley":[49],"et":[50,83],"al.":[51,84],"[7,":[52],"8],":[53],"interprocedural,":[55],"possibly":[56],"nonterminating":[57],"programs.":[58,151],"The":[59],"uses":[61],"well-formed":[62],"weak":[63],"and":[64,89,139],"strong":[65],"control":[66,78],"closure":[67,79],"relations,":[68],"which":[69],"interprocedural":[72],"extensions":[73],"generalised":[76],"weak/strong":[77],"provided":[80,116],"by":[81],"Danicic":[82],"[13],":[85],"capturing":[86],"various":[87],"nonterminating-insensitive":[88],"nontermination-sensitive":[90],"control-dependence":[91,112],"relations":[92],"that":[93,126,133,140],"have":[94,115],"been":[95],"proposed":[96],"in":[97],"literature.":[99],"Thus,":[100],"our":[101],"framework":[103],"valid":[105],"whole":[108],"range":[109],"existing":[111],"relations.":[113],"definition":[118],"semantically":[120],"correct":[121],"(SC)":[122],"slice.":[123],"prove":[125],"SC":[127,135,142],"slices":[128,136,143],"agree":[129],"with":[130],"slicing,":[132],"deterministic":[134],"preserve":[137,144],"termination,":[138],"nondeterministic":[141,146],"behavior":[147],"original":[150]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}