• Cite Icon49
  • https://doi.org/10.1145/773473.178256Copy DOI Icon

Partial dead code elimination

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A new aggressive algorithm for the elimination of partially dead code is presented, i.e., of code which is only dead on some program paths. Besides being more powerful than the usual approaches to dead code elimination, this algorithm is optimal in the following sense: partially dead code remaining in the resulting program cannot be eliminated without changing the branching structure or the semantics of the program, or without impairing some program executions. Our approach is based on techniques for partial redundancy elimination. Besides some new technical problems there is a significant difference here: partial dead code elimination introduces second order effects, which we overcome by means of exhaustive motion and elimination steps. The optimality and the uniqueness of the program obtained is proved by means of a new technique which is universally applicable and particularly useful in the case of mutually interdependent program optimizations.

Similar Papers
  • Research Article
  • Citations11

Partial dead code elimination on predicated code regions

  • Jan 01, 2006
  • Software: Practice and Experience
  • Jingling Xue +2
  • Conference Article
  • Citations3

Dead code elimination technique in eclipse compiler for Java

  • Dec 01, 2015
  • Hiral H Karer +1
  • Book Chapter
  • Citations3

Region-Based Partial Dead Code Elimination on Predicated Code

  • Jan 01, 2004
  • Qiong Cai +2
  • Book Chapter
  • Citations1

Partial dead code elimination for parallel programs

  • Jan 01, 1996
  • Jens Knoop
  • Dissertation

Classifying Dead Code in Software Development

  • Mar 01, 2022
  • Arman Alavizadeh
  • Conference Article
  • Citations32

Resource-sensitive profile-directed data flow analysis for code optimization

  • Dec 01, 1997
  • Rajiv Gupta +2
  • Conference Article
  • Citations18

Resource-sensitive profile-directed data flow analysis for code optimization

  • Nov 22, 2002
  • Rajiv Gupta +2
  • Conference Article
  • Citations48

Path profile guided partial dead code elimination using predication

  • Nov 23, 2002
  • R Gupta +2
  • Conference Article
  • Citations58

Path profile guided partial dead code elimination using predication

  • Nov 11, 1997
  • Rajiv Gupta +2
  • Conference Article
  • Citations62

Partial dead code elimination using slicing transformations

  • May 01, 1997
  • Rastislav Bodík +1
  • Conference Article
  • Citations7

Code optimization as a side effect of instruction scheduling

  • Dec 18, 1997
  • R Gupta
  • Research Article

The Opticode: A User-Centric Tool for Enhancing Software Efficiency and Minimizing Errors Through Dead Code Elimination and Loop Invariant Code Motion Techniques

  • Dec 18, 2024
  • Communications on Applied Nonlinear Analysis
  • Tulshihar Patil
  • Research Article
  • Citations10

Partial method compilation using dynamic profile information

  • Oct 01, 2001
  • ACM SIGPLAN Notices
  • John Whaley
  • Conference Article
  • Citations77

Partial method compilation using dynamic profile information

  • Oct 01, 2001
  • John Whaley
  • Research Article
  • Citations7

Partial dead code elimination using slicing transformations

  • May 01, 1997
  • ACM SIGPLAN Notices
  • Rastislav Bodík +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.