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.
No takes yet. Share an insight, caveat, or question.
Knoop et al. (1994) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: