Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,184,862 papers from all fields of science
Search
Sign In
Create Free Account
Dead code elimination
Known as:
Dead-code stripping
, Dead code strip
, DDCE
Expand
In compiler theory, dead code elimination (also known as DCE, dead code removal, dead code stripping, or dead code strip) is a compiler optimization…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
27 relations
Ahead-of-time compilation
Compile time
Compiler
Constant folding
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Efficient Decision-Directed Channel Estimation for OFDM Systems with Transmit Diversity
Kuo-Guan Wu
,
Jer-An Wu
IEEE Communications Letters
2011
Corpus ID: 11141893
To reduce the complexity involved in decision-directed channel estimation (DDCE) in orthogonal frequency-division multiplexing…
Expand
2009
2009
Novel Frame Structures to Improve System Capacity and Latency Performance of a Time-Division Duplex Multihop Relay Wireless Access System
Youhei Ohno
,
Tatsuya Shimizu
,
T. Hiraguri
,
M. Nakatsugawa
IEEE Wireless Communications and Networking…
2009
Corpus ID: 18386222
The multihop relay wireless access system is expected to eliminate dead spots by expanding Line-Of-Sight situations and to extend…
Expand
2003
2003
Dead Code Elimination in Formal Synthesis
Kai Kapp
,
V. Sabelfeld
Methoden und Beschreibungssprachen zur…
2003
Corpus ID: 28986831
Abstra t. An important optimization of behavioral ode is the elimination of dead ode 1 . In this paper, we present a pro edure…
Expand
2003
2003
Combining imperative and declarative hardware descriptions
T. Todman
,
W. Luk
36th Annual Hawaii International Conference on…
2003
Corpus ID: 1265813
This paper describes an approach for hardware development that involves both imperative and declarative descriptions. The…
Expand
1999
1999
Partial Dead Code Elimination Using Extended Value Graph
M. Takimoto
,
K. Harada
Sensors Applications Symposium
1999
Corpus ID: 28051095
This paper presents an efficient and effective code optimization algorithm for eliminating partially dead assignments, which…
Expand
1998
1998
Dead Code Elimination Through Type Inference
Ozan Hafizogullari
,
C. Kreitz
1998
Corpus ID: 60535952
We introduce a method to detect and eliminate dead code in typed functional programming languages. Our approach relies on a type…
Expand
1997
1997
Partial dead code elimination using slicing transformations
BodíkRastislav
,
GuptaRajiv
1997
Corpus ID: 215851812
We present an approach for optimizing programs that uncovers additional opportunities for optimization of a statement by…
Expand
1996
1996
Partial Dead Code Elimination for Parallel Programs
Jens Knoop
Euro-Par, Vol. I
1996
Corpus ID: 29190787
Eliminating partially dead code has proved to be a powerful technique for the runtime optimization of sequential programs. Here…
Expand
1994
1994
Partial dead code elimination
KnoopJens
,
RüthingOliver
,
SteffenBernhard
1994
Corpus ID: 215934002
A new aggressive algorithm for the elimination of partially dead code is presented, i.e., of code which is only dead on some…
Expand
1993
1993
Worst-case timing analysis of exception handling in Ada
R. Chapman
,
A. Burns
,
A. Wellings
1993
Corpus ID: 14897559
This paper describes a method for analysing the timing properties of exception handling in Ada. The paper first describes how…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE