2 Why We Need Model-Based Testing

Appendices 323
IUT. Implementation Under Test.
lazy. An algorithm that does not compute an element until it is needed. The exploration
algorithm discussed in this book is lazy.
learn. What an adaptive strategy is said to do.
level of abstraction. The amount of detail from the implementation that is represented
in the model program. A lower level of abstraction represents more detail; a
higher level represents less.
level of integration. A qualitative measure of the number of program units assembled
for testing or other project activities, ranging from the unit level (just one, or a
few, units) up to the system level (all units).
library.Acomponent that provides an API that can be used by applications or other
libraries. In .NET, a library is an assembly without a main method and usually has
the file type dll.
library model program. Alibrary created by compiling a model program coded
in C# with state variables, action methods, and enabling conditions.
link. A connection between two nodes in a graph. Also called edge or arc. Inan
FSM, the links represent transitions.
livelock. Aliveness failure where execution continues endlessly, never reaching an
accepting state.
liveness. The property that something good will happen: execution will reach an
accepting state and will avoid dead states, deadlock, and livelock. Or,agiven
scenario will be executed. Contrast to safety.
liveness analysis. Checking liveness, by searching for dead states or attempting to
execute a given scenario.
lockstep execution. Inmodel-based testing, simultaneous execution of the actions
of the model program and the implementation. Lockstep execution is supported by
a test harness called a stepper.
loop extension. Incomposition, the model program formed by adding actions that
are self-loops for each of the actions in the other model programs that are not shared
actions.
map. A collection that associates unique keys with values. In the NModel library,
mapisacompound value.
match. Determining which actions in separate model programs will be combined
in composition. Matching considers both action symbols and argument values.
memoryless. Astrategy that does not remember the history of previous action
selections. Contrast to adaptive.
more free ebooks download links at:
http://www.ebook-x.com