• Home
  • Search
  • Partial dead code elimination using slicing transformations
  • Open Access IconOpen Access
  • Cite Icon7
  • https://doi.org/10.1145/258916.258930Copy DOI Icon

Partial dead code elimination using slicing transformations

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

We present an approach for optimizing programs that uncovers additional opportunities for optimization of a statement by predicating the statement. In this paper predication algorithms for achieving partial dead code elimination (PDE) are presented. The process of predication embeds a statement in a control flow structure such that the statement is executed only if the execution follows a path along which the value computed by the statement is live. The control flow restructuring performed to achieve predication is expressed through slicing transformations . This approach achieves PDE that is not realizable by existing algorithms. We prove that our algorithm never increases the operation count along any path, and that for acyclic code all partially dead statements are eliminated. The slicing transformation that achieves predication introduces into the program additional conditional branches. These branches are eliminated in a branch deletion step based upon code duplication. We also show how PDE can be used by acyclic schedulers for VLIW processors to reduce critical path lengths along frequently executed paths.

Similar Papers
  • Conference Article
  • Citations62

Partial dead code elimination using slicing transformations

  • May 01, 1997
  • Rastislav Bodík +1
  • Research Article
  • Citations11

Partial dead code elimination on predicated code regions

  • Jan 01, 2006
  • Software: Practice and Experience
  • Jingling Xue +2
  • Book Chapter
  • Citations3

Region-Based Partial Dead Code Elimination on Predicated Code

  • Jan 01, 2004
  • Qiong Cai +2
  • 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
  • Conference Article
  • Citations7

Code optimization as a side effect of instruction scheduling

  • Dec 18, 1997
  • R Gupta
  • 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
  • Citations19

A PVS Based Framework for Validating Compiler Optimizations

  • Oct 24, 2006
  • A Kanade +2
  • Research Article
  • Citations49

Partial dead code elimination

  • Jun 01, 1994
  • ACM SIGPLAN Notices
  • Jens Knoop +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
  • Citations286

Detecting Code Clones with Graph Neural Network and Flow-Augmented Abstract Syntax Tree

  • Feb 01, 2020
  • Wenhan Wang +4
  • Research Article
  • Citations114

Parallelism for free

  • May 01, 1996
  • ACM Transactions on Programming Languages and Systems
  • Jens Knoop +2
  • Research Article
  • Citations1

A Kind of Static Software Birthmark Based on Control Flow

  • Aug 01, 2019
  • Journal of Physics: Conference Series
  • Yalin Zhao +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.