Sciweavers

1294 search results - page 102 / 259
» FFT Compiler Techniques
Sort
View
IWPC
1999
IEEE
14 years 1 months ago
Recovery of Jump Table Case Statements from Binary Code
One of the fundamental problems with the static analysis of binary (executable) code is that7 of recognizing, in a machine-independent way, the target addresses of n-conditional b...
Cristina Cifuentes, Mike Van Emmerik
ISCA
1998
IEEE
151views Hardware» more  ISCA 1998»
14 years 1 months ago
Integrated Predicated and Speculative Execution in the IMPACT EPIC Architecture
Explicitly Parallel Instruction Computing (EPIC) architectures require the compiler to express program instruction level parallelism directly to the hardware. EPIC techniques whic...
David I. August, Daniel A. Connors, Scott A. Mahlk...

Lab
597views
15 years 9 months ago
Programming Languages Team (PLT)
PLT develops foundations for building reliable, high-performance software. Foundations include practices, languages, semantics, implementation techniques and type systems. To dem...
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
14 years 3 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
RTA
2010
Springer
14 years 7 days ago
Automated Termination Analysis of Java Bytecode by Term Rewriting
We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous t...
Carsten Otto, Marc Brockschmidt, Christian von Ess...