Sciweavers

376 search results - page 14 / 76
» Optimizing Pattern Matching Compilation by Program Transform...
Sort
View
DAGSTUHL
1996
13 years 10 months ago
A Comparative Revisitation of Some Program Transformation Techniques
We revisit the main techniques of program transformation which are used in partial evaluation, mixed computation, supercompilation, generalized partial computation, rule-based prog...
Alberto Pettorossi, Maurizio Proietti
IJPP
2011
115views more  IJPP 2011»
13 years 5 days ago
Milepost GCC: Machine Learning Enabled Self-tuning Compiler
Tuning compiler optimizations for rapidly evolving hardware makes porting and extending an optimizing compiler for each new platform extremely challenging. Iterative optimization i...
Grigori Fursin, Yuriy Kashnikov, Abdul Wahid Memon...
JFP
2006
113views more  JFP 2006»
13 years 8 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
LCR
1998
Springer
150views System Software» more  LCR 1998»
14 years 29 days ago
Improving Locality in Out-of-Core Computations Using Data Layout Transformations
Programs accessing disk-resident arrays, called out-of-core programs, perform poorly in general due to an excessive number of I/O calls and insufficient help from compilers. In ord...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
PLDI
2003
ACM
14 years 2 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers