218 search results - page 31 / 44 » Generating Compiler Optimizations from Proofs |
232
click to vote
POPL
2006
ACM
16 years 3 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
128
click to vote
CC
2009
Springer
15 years 10 months ago
2009
Springer
Software systems typically exploit only a small fraction of the realizable performance from the underlying microprocessors. While there has been much work on hardware-aware optimiz...
136
Voted
JFP
2000
15 years 2 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
136
click to vote
IEEEPACT
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents an automated performance tuning solution, which partitions a program into a number of tuning sections and finds the best combination of compiler options for e...
144
click to vote
SP
2008
IEEE
15 years 9 months ago
2008
IEEE
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...