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.
2017
2017
Polynomial time estimates for #SAT
Limits on the number of satisfying assignments for CNS instances with n variables and m clauses are derived from various… 
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
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… 
2011
2011
Equivalence Checking of Array-Intensive Programs
An equivalence checking method for ensuring correctness of loop and arithmetic transformations in array intensive programs is… 
2007
2007
Characterization of probability distributions by variance bounds and its applications
2005
2005
Inapproximability Bounds for Shortest-Path Network Interdiction Problems
We consider two network interdiction problems: one where a network user tries to traverse a network from a starting vertex s to a… 
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… 
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… 
1975
1975
A unification of Cramér-Rao type bounds (Corresp.)
This correspondence examines multiparameter generalizations of the Cramer-Rao (C-R) bound and related bounds from a new viewpoint… 
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)