Dead store

Known as: Dead store optimization, Explicit bzero 
In computer programming, a local variable that is assigned a value but is not read by any subsequent instruction is referred to as a dead store. Dead… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2016
01219942016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Dead store elimination is a widely used compiler optimization that reduces code size and improves performance. However, it can… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 2
  • figure 5
Is this relevant?
2014
2014
Tracing just-in-time compilation is a popular compilation schema for the efficient implementation of dynamic languages, which is… (More)
  • figure 2
Is this relevant?
2014
2014
In this paper, we introduce novel simple and efficient analysis algorithms for scalar replacement and dead store elimination that… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
2011
2011
Probabilistic points-to analysis is an analysis technique for defining the probabilities on the points-to relations in programs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Data speculative optimization refers to code transformations that allow load and store instructions to be moved across… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
In this paper we present the internal representation and optimizations used by the CASH compiler for improving the memory… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
2000
2000
We present a simple, unified approach for the analysis and optimization of object field and array element accesses in strongly… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1994
1994
Symbolic debuggers are program development tools that allow a user to interact with an executing process at the source level. In… (More)
  • figure 1
Is this relevant?