Author(s)

B.F. Jones, H.H. Sthamer X. Yang & D.E. Eyres

Abstract

Test sets which cover all branches of a library of five procedures which solve the triangle problem, have been produced automatically using genetic algorithms. The tests are derived from both the structure of the software and its formal specification in Z. In a wider context, more complex procedures such as a binary search and a generic quicksort have also been tested automatically from the structure of the software. The value of genetic algorithms lies in their ability to handle input data which may be of a complex data structure, and to execute branches whose predicate may be a complicated and unknown function of the input data

Keywords