{"id":"https://openalex.org/W2095565544","doi":"https://doi.org/10.1145/258915.258930","title":"Partial dead code elimination using slicing transformations","display_name":"Partial dead code elimination using slicing transformations","publication_year":1997,"publication_date":"1997-05-01","ids":{"openalex":"https://openalex.org/W2095565544","doi":"https://doi.org/10.1145/258915.258930","mag":"2095565544"},"language":"en","primary_location":{"id":"doi:10.1145/258915.258930","doi":"https://doi.org/10.1145/258915.258930","is_oa":true,"landing_page_url":"https://doi.org/10.1145/258915.258930","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/258916.258930","source":{"id":"https://openalex.org/S4393917474","display_name":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","issn_l":"1531-7102","issn":["1531-7102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/258916.258930","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085160432","display_name":"Rastislav Bod\u00edk","orcid":"https://orcid.org/0000-0001-6639-1647","observed_orcids":["https://orcid.org/0000-0001-6639-1647"]},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rastislav Bod\u00edk","raw_affiliation_strings":["Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100699251","display_name":"Rajiv Gupta","orcid":"https://orcid.org/0000-0002-9348-3974","observed_orcids":["https://orcid.org/0000-0002-9348-3974"]},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajiv Gupta","raw_affiliation_strings":["Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I170201317"],"apc_list":null,"apc_paid":null,"fwci":4.5024,"has_fulltext":true,"cited_by_count":59,"citation_normalized_percentile":{"value":0.94736842,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"159","last_page":"170"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.5346999764442444,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.5346999764442444,"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/T10126","display_name":"Logic, programming, and type systems","score":0.35989999771118164,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.03620000183582306,"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/predication","display_name":"predication","score":0.875},{"id":"https://openalex.org/keywords/program-optimization","display_name":"program optimization","score":0.6380000114440918},{"id":"https://openalex.org/keywords/code-duplication","display_name":"code duplication","score":0.9909999966621399},{"id":"https://openalex.org/keywords/vliw-processors","display_name":"VLIW processors","score":0.8560000061988831},{"id":"https://openalex.org/keywords/critical-path-reduction","display_name":"critical path reduction","score":0.8949999809265137},{"id":"https://openalex.org/keywords/conditional-branches","display_name":"conditional branches","score":0.47099998593330383}],"concepts":[{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.8347002863883972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7476099729537964},{"id":"https://openalex.org/C2776190703","wikidata":"https://www.wikidata.org/wiki/Q488148","display_name":"Slicing","level":2,"score":0.701176643371582},{"id":"https://openalex.org/C91071405","wikidata":"https://www.wikidata.org/wiki/Q1413145","display_name":"Program slicing","level":3,"score":0.6533358097076416},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6309276819229126},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6116538047790527},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.5347859859466553},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5129880309104919},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5107010006904602},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.46846646070480347},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4564954340457916},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.44933128356933594},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3647850751876831},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.2520620822906494},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/258915.258930","doi":"https://doi.org/10.1145/258915.258930","is_oa":true,"landing_page_url":"https://doi.org/10.1145/258915.258930","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/258916.258930","source":{"id":"https://openalex.org/S4393917474","display_name":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","issn_l":"1531-7102","issn":["1531-7102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.5559","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.5559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.wisc.edu/~bodik/research/pldi97b.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/258915.258930","doi":"https://doi.org/10.1145/258915.258930","is_oa":true,"landing_page_url":"https://doi.org/10.1145/258915.258930","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/258916.258930","source":{"id":"https://openalex.org/S4393917474","display_name":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","issn_l":"1531-7102","issn":["1531-7102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1282359748","display_name":"PYI:  Loop Transformations and Scheduling Strategies for    Parallelization Software","funder_award_id":"9157371","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310174","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2095565544.pdf","grobid_xml":"https://content.openalex.org/works/W2095565544.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1604147565","https://openalex.org/W1970759612","https://openalex.org/W1973141977","https://openalex.org/W1976811558","https://openalex.org/W1980241249","https://openalex.org/W1993402810","https://openalex.org/W2061595191","https://openalex.org/W2062444590","https://openalex.org/W2063255488","https://openalex.org/W2068219251","https://openalex.org/W2076090418","https://openalex.org/W2116299797","https://openalex.org/W2123516374","https://openalex.org/W2129962996","https://openalex.org/W2155583896","https://openalex.org/W2159937048","https://openalex.org/W2166907479","https://openalex.org/W2293624369","https://openalex.org/W4230458386","https://openalex.org/W4242640264","https://openalex.org/W4252041437"],"related_works":["https://openalex.org/W1990349513","https://openalex.org/W2068219251","https://openalex.org/W2154794859","https://openalex.org/W4213200459","https://openalex.org/W7097502560","https://openalex.org/W2010416832","https://openalex.org/W1547884524","https://openalex.org/W2489771428","https://openalex.org/W1531760875","https://openalex.org/W1980241249"],"abstract_inverted_index":{"We":[0,93,143],"present":[1],"an":[2],"approach":[3,83],"for":[4,11,25,108,154],"optimizing":[5],"programs":[6],"that":[7,47,86,95,107,120],"uncovers":[8],"additional":[9,127],"opportunities":[10],"optimization":[12],"of":[13,36],"a":[14,39,42,57,135],"statement":[15,40,49,66],"by":[16,64,90,151],"predicating":[17],"the":[18,48,54,61,65,100,125],"statement.":[19],"In":[20],"this":[21],"paper":[22],"predication":[23,37,76,122],"algorithms":[24],"achieving":[26],"partial":[27],"dead":[28,113],"code":[29,110,141],"elimination":[30],"(PDE)":[31],"are":[32,115,132],"presented.":[33],"The":[34,69,117],"process":[35],"embeds":[38],"in":[41,134],"control":[43,70],"flow":[44,71],"structure":[45],"such":[46],"is":[50,67,77,87],"executed":[51,164],"only":[52],"if":[53],"execution":[55],"follows":[56],"path":[58,160],"along":[59,103,162],"which":[60],"value":[62],"computed":[63],"live.":[68],"restructuring":[72],"performed":[73],"to":[74,157],"achieve":[75],"expressed":[78],"through":[79],"slicing":[80,118],"transformations.":[81],"This":[82],"achieves":[84,121],"PDE":[85,147],"not":[88],"realizable":[89],"existing":[91],"algorithms.":[92],"prove":[94],"our":[96],"algorithm":[97],"never":[98],"increases":[99],"operation":[101],"count":[102],"any":[104],"path,":[105],"and":[106],"acyclic":[109,152],"all":[111],"partially":[112],"statements":[114],"eliminated.":[116],"transformation":[119],"introduces":[123],"into":[124],"program":[126],"conditional":[128],"branches.":[129],"These":[130],"branches":[131],"eliminated":[133],"branch":[136],"deletion":[137],"step":[138],"based":[139],"upon":[140],"duplication.":[142],"also":[144],"show":[145],"how":[146],"can":[148],"be":[149],"used":[150],"schedulers":[153],"VLIW":[155],"processors":[156],"reduce":[158],"critical":[159],"lengths":[161],"frequently":[163],"paths.":[165]},"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":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":7}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}