Sciweavers

27 search results - page 1 / 6
» A verifiable SSA program representation for aggressive compi...
Sort
View
POPL
2006
ACM
14 years 5 months ago
A verifiable SSA program representation for aggressive compiler optimization
Vijay Menon, Neal Glew, Brian R. Murphy, Andrew Mc...
LISP
2008
104views more  LISP 2008»
13 years 4 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
GI
2004
Springer
13 years 10 months ago
A Formal Correctness Proof for Code Generation from SSA Form in Isabelle/HOL
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
Jan Olaf Blech, Sabine Glesner
EUROPAR
2008
Springer
13 years 6 months ago
Efficiently Building the Gated Single Assignment Form in Codes with Pointers in Modern Optimizing Compilers
Abstract. Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs characterize the behavior of code ...
Manuel Arenaz, Pedro Amoedo, Juan Touriño
PLDI
2003
ACM
13 years 10 months ago
A compiler framework for speculative analysis and optimizations
Speculative execution, such as control speculation and data speculation, is an effective way to improve program performance. Using edge/path profile information or simple heuristi...
Jin Lin, Tong Chen, Wei-Chung Hsu, Pen-Chung Yew, ...