Skip to search formSkip to main contentSkip to account menu

Bounds checking

Known as: Bounds check, Index checking, Range check 
In computer programming, bounds checking is any method of detecting whether a variable is within some bounds before it is used. It is usually used to… 
Wikipedia (opens in a new tab)

Related topics

Related topics

42 relations
ACM Turing AwardALGOL 60AdaArray data structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Suboptimality Bounds for Stochastic Shortest Path Problems
We consider how to use the Bellman residual of the dynamic programming operator to compute suboptimality bounds for solutions to… 
2009
2009
Hybrid lower bound via compression of the sampled CLR function
In this paper, a new class of hybrid lower bounds on the meansquare-error of estimators is proposed. Derivation of the proposed… 
Review
2008
Review
2008
Human risk factors in avalanche incidents
An average of 12 people die in avalanches each year in Western Canada. The risk factors for the avalanche phenomenon have been… 
2007
2007
Characterization of probability distributions by variance bounds and its applications
2005
2005
A greedy strategy for detecting negative cost cycles in networks
2004
2004
Unified approach to Cramer-Rao bounds in direction estimation with known signal structures
1998
1998
Methodologies Choice and Adoption : Using Diffusion of Innovations as the Theoretical Framework
This goal of this paper is to represent the method choice and adoption factors in two organizations over the 43 years period… 
1997
1997
Robot localization - theory and practice
We consider the first stage of the robot localization problem described as follows: a robot is at an unknown position in an… 
1996
1996
A Timing Refinement of Intuitionistic Proofs and its Application to the Timing Analysis of Combinational Circuits
Up until now classical logic has been the logic of choice in formal hardware verification. This paper advances the application of… 
1975
1975
Time Bounds on the Parallel Evaluation of Arithmetic Expressions
This paper presents a number of bounds on the parallel processor evaluation of arithmetic expressions. Several previous papers… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)