Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Bounds checking

Index Bounds checking

In computer programming, bounds checking is any method of detecting whether a variable is within some bounds before it is used. [1]

41 relations: Ada (programming language), ALGOL 60, Array data structure, Bounds-checking elimination, Buffer overflow, Burroughs Corporation, C (programming language), C Sharp (programming language), Central processing unit, Computer programming, D (programming language), Dr. Dobb's Journal, Dynamic program analysis, Exception handling, Expression (computer science), Haskell (programming language), High-level programming language, ICL 2900 Series, Integer overflow, Intel MPX, Java (programming language), JavaScript, Lisp (programming language), OCaml, Off-by-one error, Optimizing compiler, PHP, Programming language, Python (programming language), Ruby (programming language), Runtime error detection, Skylake (microarchitecture), Static program analysis, Tony Hoare, Turing Award, Type system, Upper and lower bounds, USENIX, Variable (computer science), VAX, Visual Basic.

Ada (programming language)

Ada is a structured, statically typed, imperative, and object-oriented high-level computer programming language, extended from Pascal and other languages.

New!!: Bounds checking and Ada (programming language) · See more »

ALGOL 60

ALGOL 60 (short for Algorithmic Language 1960) is a member of the ALGOL family of computer programming languages.

New!!: Bounds checking and ALGOL 60 · See more »

Array data structure

In computer science, an array data structure, or simply an array, is a data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key.

New!!: Bounds checking and Array data structure · See more »

Bounds-checking elimination

In computer science, bounds-checking elimination is a compiler optimization useful in programming languages or runtimes that enforce bounds checking, the practice of checking every index into an array to verify that the index is within the defined valid range of indexes.

New!!: Bounds checking and Bounds-checking elimination · See more »

Buffer overflow

In information security and programming, a buffer overflow, or buffer overrun, is an anomaly where a program, while writing data to a buffer, overruns the buffer's boundary and overwrites adjacent memory locations.

New!!: Bounds checking and Buffer overflow · See more »

Burroughs Corporation

The Burroughs Corporation was a major American manufacturer of business equipment.

New!!: Bounds checking and Burroughs Corporation · See more »

C (programming language)

C (as in the letter ''c'') is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations.

New!!: Bounds checking and C (programming language) · See more »

C Sharp (programming language)

C# (/si: ʃɑːrp/) is a multi-paradigm programming language encompassing strong typing, imperative, declarative, functional, generic, object-oriented (class-based), and component-oriented programming disciplines.

New!!: Bounds checking and C Sharp (programming language) · See more »

Central processing unit

A central processing unit (CPU) is the electronic circuitry within a computer that carries out the instructions of a computer program by performing the basic arithmetic, logical, control and input/output (I/O) operations specified by the instructions.

New!!: Bounds checking and Central processing unit · See more »

Computer programming

Computer programming is the process of building and designing an executable computer program for accomplishing a specific computing task.

New!!: Bounds checking and Computer programming · See more »

D (programming language)

D is an object-oriented, imperative, multi-paradigm system programming language created by Walter Bright of Digital Mars and released in 2001.

New!!: Bounds checking and D (programming language) · See more »

Dr. Dobb's Journal

Dr.

New!!: Bounds checking and Dr. Dobb's Journal · See more »

Dynamic program analysis

Dynamic program analysis is the analysis of computer software that is performed by executing programs on a real or virtual processor.

New!!: Bounds checking and Dynamic program analysis · See more »

Exception handling

Exception handling is the process of responding to the occurrence, during computation, of exceptions – anomalous or exceptional conditions requiring special processing – often changing the normal flow of program execution.

New!!: Bounds checking and Exception handling · See more »

Expression (computer science)

An expression in a programming language is a combination of one or more constants, variables, operators, and functions that the programming language interprets (according to its particular rules of precedence and of association) and computes to produce ("to return", in a stateful environment) another value.

New!!: Bounds checking and Expression (computer science) · See more »

Haskell (programming language)

Haskell is a standardized, general-purpose compiled purely functional programming language, with non-strict semantics and strong static typing.

New!!: Bounds checking and Haskell (programming language) · See more »

High-level programming language

In computer science, a high-level programming language is a programming language with strong abstraction from the details of the computer.

New!!: Bounds checking and High-level programming language · See more »

ICL 2900 Series

The ICL 2900 Series was a range of mainframe computer systems announced by the UK manufacturer ICL on 9 October 1974.

New!!: Bounds checking and ICL 2900 Series · See more »

Integer overflow

In computer programming, an integer overflow occurs when an arithmetic operation attempts to create a numeric value that is outside of the range that can be represented with a given number of bits – either larger than the maximum or lower than the minimum representable value.

New!!: Bounds checking and Integer overflow · See more »

Intel MPX

Intel MPX (Memory Protection Extensions) is a set of extensions to the x86 instruction set architecture.

New!!: Bounds checking and Intel MPX · See more »

Java (programming language)

Java is a general-purpose computer-programming language that is concurrent, class-based, object-oriented, and specifically designed to have as few implementation dependencies as possible.

New!!: Bounds checking and Java (programming language) · See more »

JavaScript

JavaScript, often abbreviated as JS, is a high-level, interpreted programming language.

New!!: Bounds checking and JavaScript · See more »

Lisp (programming language)

Lisp (historically, LISP) is a family of computer programming languages with a long history and a distinctive, fully parenthesized prefix notation.

New!!: Bounds checking and Lisp (programming language) · See more »

OCaml

OCaml, originally named Objective Caml, is the main implementation of the programming language Caml, created by Xavier Leroy, Jérôme Vouillon, Damien Doligez, Didier Rémy, Ascánder Suárez and others in 1996.

New!!: Bounds checking and OCaml · See more »

Off-by-one error

An off-by-one error (OBOE), also commonly known as an OBOB (off-by-one bug), or OB1 error is a logic error involving the discrete equivalent of a boundary condition.

New!!: Bounds checking and Off-by-one error · See more »

Optimizing compiler

In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program.

New!!: Bounds checking and Optimizing compiler · See more »

PHP

PHP: Hypertext Preprocessor (or simply PHP) is a server-side scripting language designed for Web development, but also used as a general-purpose programming language.

New!!: Bounds checking and PHP · See more »

Programming language

A programming language is a formal language that specifies a set of instructions that can be used to produce various kinds of output.

New!!: Bounds checking and Programming language · See more »

Python (programming language)

Python is an interpreted high-level programming language for general-purpose programming.

New!!: Bounds checking and Python (programming language) · See more »

Ruby (programming language)

Ruby is a dynamic, interpreted, reflective, object-oriented, general-purpose programming language.

New!!: Bounds checking and Ruby (programming language) · See more »

Runtime error detection

Runtime error detection is a software verification method that analyzes a software application as it executes and reports defects that are detected during that execution.

New!!: Bounds checking and Runtime error detection · See more »

Skylake (microarchitecture)

Skylake is the codename used by Intel for a processor microarchitecture that was launched in August 2015 succeeding the Broadwell microarchitecture.

New!!: Bounds checking and Skylake (microarchitecture) · See more »

Static program analysis

Static program analysis is the analysis of computer software that is performed without actually executing programs.

New!!: Bounds checking and Static program analysis · See more »

Tony Hoare

Sir Charles Antony Richard Hoare (born 11 January 1934), is a British computer scientist.

New!!: Bounds checking and Tony Hoare · See more »

Turing Award

The ACM A.M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) to an individual selected for contributions "of lasting and major technical importance to the computer field".

New!!: Bounds checking and Turing Award · See more »

Type system

In programming languages, a type system is a set of rules that assigns a property called type to the various constructs of a computer program, such as variables, expressions, functions or modules.

New!!: Bounds checking and Type system · See more »

Upper and lower bounds

In mathematics, especially in order theory, an upper bound of a subset S of some partially ordered set (K, ≤) is an element of K which is greater than or equal to every element of S. The term lower bound is defined dually as an element of K which is less than or equal to every element of S. A set with an upper bound is said to be bounded from above by that bound, a set with a lower bound is said to be bounded from below by that bound.

New!!: Bounds checking and Upper and lower bounds · See more »

USENIX

The USENIX Association is the Advanced Computing Systems Association.

New!!: Bounds checking and USENIX · See more »

Variable (computer science)

In computer programming, a variable or scalar is a storage location (identified by a memory address) paired with an associated symbolic name (an identifier), which contains some known or unknown quantity of information referred to as a value.

New!!: Bounds checking and Variable (computer science) · See more »

VAX

VAX is a discontinued instruction set architecture (ISA) developed by Digital Equipment Corporation (DEC) in the mid-1970s.

New!!: Bounds checking and VAX · See more »

Visual Basic

Visual Basic is a third-generation event-driven programming language and integrated development environment (IDE) from Microsoft for its Component Object Model (COM) programming model first released in 1991 and declared legacy during 2008.

New!!: Bounds checking and Visual Basic · See more »

Redirects here:

Bounds check, Index checking, Range check.

References

[1] https://en.wikipedia.org/wiki/Bounds_checking

OutgoingIncoming
Hey! We are on Facebook now! »