2 Why We Need Model-Based Testing

318 Glossary
compound value. An NModel data type which is a value type that can handle
tree-structured and variable-length data. The NModel data types set, map, sequence,
value array, and bag derive from compound value.
concurrent system. A system where more than one program runs at a time. Multithreaded
programs and distributed systems are examples of concurrent systems.
conform. Tobeinconformance.
conformance. Agreement between an implementation and a model program.
conjunction. An expression that contains the and operator, && in C#. Contrast to
disjunction.
contract model program. Amodel program intended to act as a specification.
Contrast to scenario model program.
control state. The part of the state that determines which actions are enabled. The
state variables that appear in enabling conditions. Contrast to data state.
control structure. Code that controls which statements are executed and in which
order. In model programs, control structure is replaced by enabling conditions.
controllable action. Anaction that can be invoked under the control of a test
harness. Also called tester action. Contrast to observable action.
cover. To visit a coverage point by exercising some program part or property.
coverage. A measure of how much testing has been done.
coverage point. A part or property of a program used to measure coverage, by
counting how many times it is executed, visited, or otherwise exercised. A state, an
action, or a branch in the code could be a coverage point. A strategy can use coverage
points. In the NModel framework, coverage points are represented by terms.
current state. The state before a transition.
cycle. A loop in a graph. A cycle in an FSM indicates repetitive behavior and might
indicate a livelock.
data abstraction. Abstraction applied to variables. A higher level of data abstraction
uses fewer variables, fewer values for those variables, and simpler data types.
data state. The part of the state that does not determine control flow. Contrast to
control state.
dead state.Astate from which an accepting state cannot be reached. A system that
reaches a dead state experiences a liveness failure. Dead states indicate deadlocks
or livelocks.
deadlock. Aliveness failure where a program stops executing because it reaches a
state where no actions are enabled.
more free ebooks download links at:
http://www.ebook-x.com