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.
2013
2013
LLBMC: Improved Bounded Model Checking of C Programs Using LLVM - (Competition Contribution)
LLBMC is a tool for detecting bugs and runtime errors in C and C++ programs. It is based on bounded model checking using an SMT… 
2011
2011
Adaptive Path Planning for Randomly Deployed Wireless Sensor Networks
In this paper, we propose an adaptive path planning scheme considering the length of movement path and number of beacon messages… 
2010
2010
A Unified View of Regularized Dual Averaging and Mirror Descent with Implicit Updates
We study three families of online convex optimization algorithms: follow-the-proximally-regularized-leader (FTRL-Proximal… 
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
2003
2003
Spar: a set of extensions to Java for scientific computation
We present a set of language extensions that improve the expressiveness and performance of Java for scientific computation. The… 
1985
1985
Coding for the binary symmetric broadcast channel with two receivers
Block coding for the binary symmetric broadcast channel with two receivers is investigated. A graph-theoretic approach to the… 
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)