## boundary scan

The use of scan registers to capture state from device input and output pins. IEEE Standard 1149.1-1990 describes the international standard implementation (sometimes called JTAG after the Joint Test Action Group which began the standardisation work).

Last updated: 1995-02-14

## boundary value

## boundary value analysis

A test data selection technique in which values are chosen to lie along data extremes. Boundary values include maximum, minimum, just inside/outside boundaries, typical values, and error values. The hope is that, if a systems works correctly for these special values then it will work correctly for all values in between.

Last updated: 1996-05-10

## bounded

<*theory*>

In domain theory, a subset S of a cpo X is bounded if there exists x in X such that for all s in S, s <= x. In other words, there is some element above all of S. If every bounded subset of X has a least upper bound then X is boundedly complete.

("<=" is written in LaTeX as \subseteq).

Last updated: 1995-02-03

## boundedly complete

<*theory*>

(Or "consistently complete") In domain theory, a complete partial order is boundedly complete if every bounded subset has a least upper bound.

Last updated: 2014-07-01

## bound variable

1. A bound variable or formal argument in a function definition is replaced by the actual argument when the function is applied. In the lambda abstraction

\ x . Mx is the bound variable. However, x is a free variable of the term M when M is considered on its own. M is the scope of the binding of x.

2. In logic a bound variable is a quantified variable. See quantifier.

### Nearby terms:

bounce message ♦ **boundary scan** ♦ boundary value ♦ boundary value analysis

Try this search on Wikipedia, OneLook, Google