Study of algebraic and state based testing techniques

Abstract

Sequential programs can be modeled as algebra or transitions on a state space. Whether a program is implemented according to its model is the question addressed by program testing. The thesis illustrates issues in constructing a finite test set from algebraic and state transition based specifications. Test hypotheses need to be formulated to generalise results of testing from a finite test set to the entire input domain of a program under test. It is demonstrated with examples that test hypotheses are constraints on program under test. Testing can lead to sound conclusions for the class of programs that satisfy the constraints. The theory proposed in [BGM91] is used to illustrate test selection from algebraic specifications. Z notation is used to express state transitions of a heap sort example that illustrates testing from state based specifications.