Sciweavers

376 search results - page 55 / 76
» Optimizing Pattern Matching Compilation by Program Transform...
Sort
View
227
Voted
POPL
2007
ACM
16 years 2 months ago
Lightweight fusion by fixed point promotion
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
Atsushi Ohori, Isao Sasano
131
Voted
POPL
2010
ACM
15 years 11 months ago
A simple, verified validator for software pipelining
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...
Jean-Baptiste Tristan, Xavier Leroy
121
Voted
PODS
2005
ACM
99views Database» more  PODS 2005»
16 years 2 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
IEEECIT
2010
IEEE
15 years 12 days ago
Superblock-Based Source Code Optimizations for WCET Reduction
—Superblocks represent regions in a program code that consist of multiple basic blocks. Compilers benefit from this structure since it enables optimization across block boundari...
Paul Lokuciejewski, Timon Kelter, Peter Marwedel
95
Voted
CASES
2009
ACM
15 years 8 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...