Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,291
Eliminating Array Bound Checking Through Dependent Types
- In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation
, 1998
"... We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This enables the programmer to capture more invariants through types while type-checking remains decidable in theory and can s ..."
Abstract
-
Cited by 186 (24 self)
- Add to MetaCart
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This enables the programmer to capture more invariants through types while type-checking remains decidable in theory and can
Optimization of Array Bound Checking
, 2000
"... Optimization of array bound checking at compile-time is performed in order to reduce the overhead of the run-time checking. There are many researches in this field but the results seem not very highly appreciated, even with the commercial compilers. This paper describes two techniques for array ..."
Abstract
- Add to MetaCart
Optimization of array bound checking at compile-time is performed in order to reduce the overhead of the run-time checking. There are many researches in this field but the results seem not very highly appreciated, even with the commercial compilers. This paper describes two techniques for array
Optimizing array bound checks using flow analysis
- ACM Letters on Programming Languages and Systems
, 1993
"... Bound checks are introduced in programs for the run-time detection of array bound violations. Compile-time optimizations are employed to reduce the execution-time overhead due to bound checks. The optimizations reduce the program execution time through elimination of checks and propagation of checks ..."
Abstract
-
Cited by 81 (3 self)
- Add to MetaCart
Bound checks are introduced in programs for the run-time detection of array bound violations. Compile-time optimizations are employed to reduce the execution-time overhead due to bound checks. The optimizations reduce the program execution time through elimination of checks and propagation
1.1 Array Bound Check
"... Compiler optimization technology has been steadily advancing as more sophisticated processors hit the market. For high end embedded processors, today’s most advanced compilers take advantage of both CPU specific and application specific information to optimize code intelligently for optimal result. ..."
Abstract
- Add to MetaCart
. This paper discusses one such sophisticated optimization technique which combines array bound check optimization together with redundancy elimination combined with folding. The array bound check optimization described in this paper reduces the run time overhead by eliminating unnecessary bound checks
ABCD: Eliminating Array Bounds Checks on Demand
, 2000
"... To guarantee execution, Java and other strongly typed languages require bounds checking of array accesses. Because bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination or i ..."
Abstract
-
Cited by 148 (7 self)
- Add to MetaCart
To guarantee execution, Java and other strongly typed languages require bounds checking of array accesses. Because bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination
Efficient Intraprocedural Array Bound Checking
"... Array bound checking is critical for code safety and debugging but users are not ready to trade much execution time for it. A considerable research work has been carried out during the past 25 years but experimental results are scarce. Commercial implementations are limited to intraprocedural array ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Array bound checking is critical for code safety and debugging but users are not ready to trade much execution time for it. A considerable research work has been carried out during the past 25 years but experimental results are scarce. Commercial implementations are limited to intraprocedural array
Efficient Intraprocedural Array Bound Checking
"... ABSTRACT Array bound checking is critical for code safety and debugging but users are not ready to trade much execution time for it. A considerable research work has been carried out during the past 25 years but experimental results are scarce. Commercial implementations are limited to intraprocedur ..."
Abstract
- Add to MetaCart
ABSTRACT Array bound checking is critical for code safety and debugging but users are not ready to trade much execution time for it. A considerable research work has been carried out during the past 25 years but experimental results are scarce. Commercial implementations are limited
A fresh look at optimizing array bound checking
- In Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation
, 1990
"... Abstract- 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 discussed in this paper also reduce the overhead due to range checks that cannot be eliminated by compile-time analysis ..."
Abstract
-
Cited by 65 (7 self)
- Add to MetaCart
Abstract- 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 discussed in this paper also reduce the overhead due to range checks that cannot be eliminated by compile
Checking array bound violation using segmentation hardware
- In Proc. of the International Conference on Dependable Systems and Networks
, 2005
"... The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avoid many difficult bugs down the line. This paper proposes a novel approach called Cash to the array bound checking proble ..."
Abstract
-
Cited by 19 (1 self)
- Add to MetaCart
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avoid many difficult bugs down the line. This paper proposes a novel approach called Cash to the array bound checking
Results 1 - 10
of
2,291
