{"id":"https://openalex.org/W70225202","doi":null,"title":"An efficient algorithm for computing all program static slices","display_name":"An efficient algorithm for computing all program static slices","publication_year":2005,"publication_date":"2005-02-13","ids":{"openalex":"https://openalex.org/W70225202","mag":"70225202"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.496.1416","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.496.1416","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wseas.us/e-library/conferences/2005salzburg/papers/492-182.pdf","raw_type":"text"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5033958019","display_name":"Jehad Al Dallal","orcid":"https://orcid.org/0000-0003-3679-4351","observed_orcids":["https://orcid.org/0000-0003-3679-4351"]},"institutions":[{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]}],"countries":["KW"],"is_corresponding":true,"raw_author_name":"Jehad Al Dallal","raw_affiliation_strings":["Department of Information Sciences, Kuwait University, Safat, Kuwait"],"raw_orcid":"https://orcid.org/0000-0003-3679-4351","affiliations":[{"raw_affiliation_string":"Department of Information Sciences, Kuwait University, Safat, Kuwait","institution_ids":["https://openalex.org/I36721946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033958019"],"corresponding_institution_ids":["https://openalex.org/I36721946"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0066758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"27","last_page":null},"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.6577000021934509,"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.6577000021934509,"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/T10126","display_name":"Logic, programming, and type systems","score":0.2117999941110611,"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.09520000219345093,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/program-slicing","display_name":"program slicing","score":0.9990000128746033},{"id":"https://openalex.org/keywords/static-slicing","display_name":"static slicing","score":0.746999979019165},{"id":"https://openalex.org/keywords/backward-slicing","display_name":"backward slicing","score":0.9309999942779541},{"id":"https://openalex.org/keywords/program-dependence-graph","display_name":"program dependence graph","score":0.9919999837875366},{"id":"https://openalex.org/keywords/debugging","display_name":"debugging","score":0.7940000295639038}],"concepts":[{"id":"https://openalex.org/C91071405","wikidata":"https://www.wikidata.org/wiki/Q1413145","display_name":"Program slicing","level":3,"score":0.8797889947891235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7778476476669312},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.61113041639328},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5529355406761169},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5432762503623962},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5153664946556091},{"id":"https://openalex.org/C2776937632","wikidata":"https://www.wikidata.org/wiki/Q4117718","display_name":"Program synthesis","level":2,"score":0.4707287549972534},{"id":"https://openalex.org/C2777362769","wikidata":"https://www.wikidata.org/wiki/Q40056","display_name":"Computer program","level":2,"score":0.46582648158073425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4598435163497925},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.4410388469696045},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3784673810005188},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3411324620246887},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31300416588783264},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.496.1416","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.496.1416","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wseas.us/e-library/conferences/2005salzburg/papers/492-182.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.720.217","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.720.217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.isc.ku.edu.kw/drjehad/Algorithm%20for%20Computing%20all%20Program%20Static%20Slices.pdf","raw_type":"text"},{"id":"mag:70225202","doi":null,"is_oa":false,"landing_page_url":"http://www.wseas.us/e-library/conferences/2005salzburg/papers/492-182.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Software Engineering","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1575308494","https://openalex.org/W1980767016","https://openalex.org/W1997493115","https://openalex.org/W2064625489","https://openalex.org/W2079055089","https://openalex.org/W2092483417","https://openalex.org/W2127280681","https://openalex.org/W2141109493","https://openalex.org/W2142993980","https://openalex.org/W2145268645","https://openalex.org/W2147088720","https://openalex.org/W2162310108","https://openalex.org/W2293624369"],"related_works":["https://openalex.org/W2259726502","https://openalex.org/W6892596329","https://openalex.org/W205257065","https://openalex.org/W2034103799","https://openalex.org/W1984248430","https://openalex.org/W80989540","https://openalex.org/W120582129","https://openalex.org/W281601022","https://openalex.org/W141783145","https://openalex.org/W117886902"],"abstract_inverted_index":{"Abstract:-":[0],"Program":[1,191,196],"slicing":[2],"is":[3,42,101,116,133,142,164,189],"the":[4,18,31,59,92,95,99,113,124,127,155,161],"task":[5],"of":[6,20,26,33,121,149,178],"finding":[7],"all":[8,146],"statements":[9,27],"in":[10,39,123,186],"a":[11,21,34,40,44,83,86,150,179],"program":[12,41,45,55,60,70,77,87,131,152,156,173,182,202],"that":[13,28,97,170],"directly,":[14],"or":[15,94,104,130],"indirectly,":[16],"influence":[17],"value":[19,32],"variable":[22,35],"occurrence.":[23],"The":[24,72,181],"set":[25],"can":[29],"affect":[30],"at":[36,68,85,175],"some":[37],"point":[38,120],"called":[43,190],"backward":[46,200],"slice.":[47],"In":[48,89,137],"several":[49,64,135],"software":[50,167],"engineering":[51,168],"applications,":[52],"such":[53],"as":[54],"debugging":[56],"and":[57,62],"measuring":[58],"cohesion":[61],"parallelism,":[63],"slices":[65,78,148,174],"are":[66,79],"computed":[67],"different":[69,176],"points.":[71],"existing":[73],"algorithms":[74],"for":[75,118,166],"computing":[76,172],"introduced":[80,143,162],"to":[81,144],"compute":[82,108,145],"slice":[84],"point.":[88],"these":[90],"algorithms,":[91],"program,":[93,100,129],"model":[96],"represents":[98],"traversed":[102,134],"completely":[103],"partially":[105],"once.":[106,159],"To":[107],"more":[109],"than":[110],"one":[111],"slice,":[112],"same":[114,128],"algorithm":[115,141,163],"applied":[117],"every":[119],"interest":[122],"program.":[125,180],"Thus,":[126],"representation,":[132],"times.":[136],"this":[138,187],"paper,":[139],"an":[140],"static":[147,198],"computer":[151],"by":[153],"traversing":[154],"representation":[157,183],"graph":[158,184],"Therefore,":[160],"useful":[165],"applications":[169],"require":[171],"points":[177],"used":[185],"paper":[188],"Dependence":[192],"Graph":[193],"(PDG).":[194],"Key-Words:-":[195],"slicing,":[197,199,201],"dependence":[203],"graph.":[204],"1":[205]},"counts_by_year":[],"updated_date":"2026-10-06T10:28:23.643775","created_date":"2016-06-24T00:00:00"}