Skip to search formSkip to main contentSkip to account menu

Dead code elimination

Known as: Dead-code stripping, Dead code strip, DDCE 
In compiler theory, dead code elimination (also known as DCE, dead code removal, dead code stripping, or dead code strip) is a compiler optimization… 
Wikipedia (opens in a new tab)

Related topics

Related topics

27 relations
Ahead-of-time compilationCompile timeCompilerConstant folding

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
From BPMN Process Models to BPEL Web Services
The business process modelling notation (BPMN) is a graph-oriented language in which control and action nodes can be connected… 
Highly Cited
2006
Highly Cited
2006
Translating BPMN to BPEL
The Business Process Modelling Notation (BPMN) is a graph-oriented language in which control and action nodes can be connected… 
Highly Cited
2003
Highly Cited
2003
Analysis of Web Services Composition Languages: The Case of BPEL4WS
Web services composition is an emerging paradigm for application integration within and across organizational boundaries. A… 
Highly Cited
2001
Highly Cited
2001
Dead-block prediction & dead-block correlating prefetchers
Effective data prefetching requires accurate mechanisms to predict both "which" cache blocks to prefetch and "when" to prefetch… 
Highly Cited
1999
Highly Cited
1999
Dead Code Elimination through Dependent Types
Pattern matching is an important feature in various functional programming languages such as SML, Caml, Haskell, etc. In these… 
1998
1998
Dead Code Elimination Through Type Inference
We introduce a method to detect and eliminate dead code in typed functional programming languages. Our approach relies on a type… 
Highly Cited
1997
Highly Cited
1997
Partial dead code elimination using slicing transformations
We present an approach for optimizing programs that uncovers additional opportunities for optimization of a statement by… 
Highly Cited
1995
Highly Cited
1995
Interprocedural partial redundancy elimination and its application to distributed memory compilation
Partial Redundancy Elimination (PRE) is a general scheme for suppressing partial redundancies which encompasses traditional… 
Highly Cited
1994
Highly Cited
1994
Partial dead code elimination
A new aggressive algorithm for the elimination of partially dead code is presented, i.e., of code which is only dead on some… 
1994
1994
Partial dead code elimination
A new aggressive algorithm for the elimination of partially dead code is presented, i.e., of code which is only dead on some… 
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)