4355 search results - page 176 / 871 » From Interpretation to Compilation |
115
click to vote
LCPC
2001
Springer
15 years 9 months ago
2001
Springer
Information gathered by the existing pointer analysis techniques can be classified as must aliases or definitely-points-to relationships, which hold for all executions, and may a...
127
click to vote
SAC
1996
ACM
15 years 8 months ago
1996
ACM
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
168
click to vote
MICRO
1993
IEEE
15 years 8 months ago
1993
IEEE
Compile-time code transformations which expose instruction-level parallelism (ILP) typically take into account the constraints imposed by all execution scenarios in the program. H...
116
Voted
PLDI
1992
ACM
15 years 8 months ago
1992
ACM
: SELF's debugging system provides complete source-level debugging (expected behavior) with globally optimized code. It shields the debugger from optimizations performed by th...
146
click to vote
CC
2006
Springer
15 years 8 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...