Sciweavers

42 search results - page 1 / 9
» Efficient and precise array access analysis
Sort
View
TOPLAS
2002
89views more  TOPLAS 2002»
13 years 4 months ago
Efficient and precise array access analysis
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
Yunheung Paek, Jay Hoeflinger, David A. Padua
ECRTS
2010
IEEE
13 years 6 months ago
Precise and Efficient FIFO-Replacement Analysis Based on Static Phase Detection
Schedulability analysis for hard real-time systems requires bounds on the execution times of its tasks. To obtain useful bounds in the presence of caches, static timing analyses mu...
Daniel Grund, Jan Reineke
PLDI
1998
ACM
13 years 9 months ago
Simplification of Array Access Patterns for Compiler Optimizations
Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscr...
Yunheung Paek, Jay Hoeflinger, David A. Padua
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
13 years 10 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
CC
2011
Springer
270views System Software» more  CC 2011»
12 years 8 months ago
Subregion Analysis and Bounds Check Elimination for High Level Arrays
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
Mackale Joyner, Zoran Budimlic, Vivek Sarkar