309 search results - page 36 / 62 » Code Transformations for One-Pass Analysis |
209
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
124
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...
105
click to vote
SCAM
2008
IEEE
15 years 9 months ago
2008
IEEE
Data-flow analysis is a common technique to gather program information for use in transformations such as register allocation, dead-code elimination, common subexpression elimina...
132
Voted
POPL
2012
ACM
13 years 10 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
155
Voted
MICRO
1993
IEEE
15 years 6 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...