Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Loop-invariant code motion

Known as: Loop invariant hoisting, Loop hoisting, LICM 
In computer programming, loop-invariant code consists of statements or expressions (in an imperative programming language) which can be moved outside… Expand
Wikipedia

Related topics

Related topics

22 relations
Block (programming)Code bloatCommon subexpression eliminationComputer programming
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
A novel bit-level image encryption algorithm based on 2D-LICM hyperchaotic map
Abstract In this paper, a new two-dimensional Logistic ICMIC cascade map (2D-LICM) is proposed based on cascade modulation couple… Expand
Highly Cited
2012
Highly Cited
2012
Fast and precise hybrid type inference for JavaScript
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information… Expand
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
2004
2004
Loop Invariant Code Motion in Code Generator
Loop invariant code motion (LICM) is a traditional optimization. In modern compiler,it is normally per-formed by the phases of… Expand
Highly Cited
2002
Highly Cited
2002
Dynamic dead-instruction detection and elimination
We observe a non-negligible fraction--3 to 16% in our benchmarks--of dynamically dead instructions, dynamic instruction instances… Expand
  • figure 1
  • table 1
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2000
Highly Cited
2000
ABCD: eliminating array bounds checks on demand
To guarantee typesafe execution, Java and other strongly typed languages require bounds checking of array accesses. Because array… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Highly Cited
1999
Highly Cited
1999
Partial redundancy elimination in SSA form
The SSAPRE algorithm for performing partial redundancy elimination based entirely on SSA form is presented. The algorithm is… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1993
Highly Cited
1993
The multiscalar architecture
The centerpiece of this thesis is a new processing paradigm for exploiting instruction level parallelism. This paradigm, called… Expand
  • figure 2.1
  • table 2.1
  • figure 2.2
  • figure 2.3
  • table 2.2
1988
1988
Unfold/fold transformations and loop optimization of logic programs
Programs typically spend much of their execution time in loops. This makes the generation of efficient code for loops essential… Expand
Highly Cited
1982
Highly Cited
1982
Symbolic Debugging of Optimized Code
The long standing conflict between the optimization of code and the ability to symbolically debug the code is examined. The… Expand
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1982
Highly Cited
1982
Optimization of range checking
An analysis is given for optimizing run-time range checks in regions of high execution frequency. These optimizations are… Expand
  • figure 1
  • figure 2
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE