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… 
2016
2016
SMOV: Array Bound-Check and access in a single instruction
A Buffer Overflow (BOF) continues to be among the top open doors to worms and malware. Earlier in 2014, the security world was… 
2013
2013
Hierarchical Clustering For Cancer Discovery Using Range Check And Delta Check
Class discovery is one of the most important tasks in cancer classification using biomolecular data. To perform this, a multiple… 
2012
2012
Froissart Bounds for Amplitudes and Cross Sections at High Energies
High-energy behavior of total cross sections is discussed in experiment and theory. Origin and meaning of the Froissart bounds… 
2007
2007
Characterization of probability distributions by variance bounds and its applications
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… 
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… 
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)