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
Multi CPU invalidate operation bypass through address range check
The invention relates to a cache memory system and a method for performing a block invalidate operation. A method in embodiments… 
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… 
2003
2003
Skewed Occurrence Frequency of Water Temperature and Salinity in the Subarctic Regions
In a previous paper (Oguma and Nagata, 2002), it was shown that frequency distributions of temperature and salinity in the sea… 
2003
2003
On Recent Cheeger-Type Bounds for Nonmaximal Eigenvalues Applied to Positive Matrices
This paper is concerned with Cheeger-type bounds for nonmaximal eigenvalues of nonnegative irreducible matrices. It is shown that… 
1999
1999
Iterative Receiver Techniques for Coded Multiple Access Communication Systems
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…