Live briefing
Everything about Bounds checking
In programming, detecting whether a variable is within given bounds before use
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 ensure that a number fits into a given type, or that a variable being used as an array index is within the bounds of the array. A failed bounds check usually results in the generation of some sort of exception signal. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Bounds checkingA 5-minute orientation
- Skim a recent paper: Distributed bounded model checkingInfluential work since 2022
- Pick up a classic book: BibleThe most-reprinted book on the subject
- Read the landmark paper: Model checking expected time and expected reward formulae with random time boundsCited 21 times
- Go sideways: Memory safetyA closely related topic
- Go sideways: Bounds-checking eliminationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Model checking expected time and expected reward formulae with random time bounds
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Lower bounds on lengths of checking sequences
Model checking response times in Networked Automation Systems using jitter bounds
Asymptotic Perturbation Bounds for Probabilistic Model Checking with Empirically Determined Probability Parameters
Strict Lower Bounds for Model Checking BPA
Coherence checking and propagation of lower probability bounds
Bounds Checking on GPU
🆕 Influential since 2022
📚 Books worth reading
BibleBible · 1200
Pride and PrejudiceJane Austen · 1813
The Sea of MonstersRick Riordan · 2005
Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
The Starless SeaErin Morgenstern · 2019
Language and Automata Theory and ApplicationsAdrian-Horia Dediu · 2012
Data structures and algorithm analysis in CMark Allen Weiss · 1993
A student's guide to coding and information theoryStefan M. Moser · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Memory safety Memory safety is the state of being protected from various software bugs and security vulnerabilities when dealing with memory access, such as buffer overflows…
- Bounds-checking elimination In computer science, bounds-checking elimination is a compiler optimization useful in programming languages or runtime systems that enforce bounds checking…
- JS++ JS++ is a programming language for web development that extends JavaScript with a sound type system. It includes imperative, object-oriented, functional…
- Undefined behavior A computer program exhibits undefined behavior (UB) when it contains, or is executing code for which its programming language specification does not mandate…
- Union type In computer science, a union is a value that may have any of multiple representations or formats within the same area of memory, or a variable that may…
- Comparison of programming languages Programming languages are used for controlling the behavior of a machine (often a computer). Like natural languages, programming languages follow rules…
- Comparison of Java and C++ Java and C++ are two prominent object-oriented programming languages. By many language popularity metrics, the two languages have dominated object-oriented…
- Execution (computing) In computing, execution is a process by which a computer program is read by a computer and the computer performs the actions encoded in the program. As…