16 search results - page 1 / 4 » Elimination of Redundant Array Subscript Range Checks |
PLDI
1995
ACM
13 years 8 months ago
1995
ACM
CC
2011
Springer
12 years 8 months ago
2011
Springer
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
PLDI
1990
ACM
13 years 9 months ago
1990
ACM
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
PADO
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
ICCL
1998
IEEE
13 years 9 months ago
1998
IEEE
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...