4355 search results - page 313 / 871 » From Interpretation to Compilation |
175
click to vote
PLDI
2003
ACM
15 years 12 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
192
click to vote
PLDI
2003
ACM
15 years 12 months ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
187
Voted
LCTRTS
2001
Springer
15 years 11 months ago
2001
Springer
1 COTS (commercial off-the-shelf) devices are capable of executing powerful, distributed algorithms. Very large, adaptive systems can be created by simply integrating these devices...
226
click to vote
PLDI
1997
ACM
15 years 11 months ago
1997
ACM
This paper presents dynamic feedback, a technique that enables computations to adapt dynamically to different execution environments. A compiler that uses dynamic feedback produce...
157
click to vote
CGO
2003
IEEE
15 years 10 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...