Finite state testing of structured programs
The research reported in this paper is concerned with the testing of software which is being developed in a structured way. The advantages which accrue from a well structured or modular organisation of software depend upon an ability to independently test a module well before the full development of all the modules with which it communicates. This paper describes a technique (finite state testing) which effectively organises data objects into equivalence classes and exercises a module using a representative of each class. As a technique it has an affinity with both the type checking performed by a conventional compiler and the assertion checking performed by a so-called verifying compiler. It is however a practical technique which has been used in experimental systems and is being incorporated in a prototype program development system.
Unable to display preview. Download preview PDF.
- 1.Campbell, R. and Habermann, N. The specification of process synchronisation by path expressions (to be published 1974)Google Scholar
- 2.Henderson, P. and Snowdon, R.A. An experiment in structured programming BIT Vol. 12 No. 1 1972Google Scholar
- 3.Hoare, C.A.R. An axiomatic approach to computer programming Comm. A.C.M. Vol. 12 p. 576, 1969Google Scholar
- 4.Snowdon, R.A. Pearl: An interactive system for the preparation and validation of structured programs in "Program Test Methods", W.C. Hetzel (ed.), Prentice-Hall, 1973Google Scholar
- 5.Zurcher, F.W. and Randell, B. Iterative multi-level modelling — a methodology for computer system design IFIP Congress, Edinburgh 1968Google Scholar