Accession Number : AD0780907

Title :   Meaning of Exhaustive Software Testing,

Corporate Author : POLYTECHNIC INST OF NEW YORK BROOKLYN DEPT OF ELECTRICAL ENGINEERING AND ELECTROPHYSICS

Personal Author(s) : Shooman,Martin L.

Report Date : 02 JAN 1974

Pagination or Media Count : 14

Abstract : The report defines the concept of an exhaustive software test in terms of a particular problem: The solution for the roots of quadratic equation with coefficients constrained to the range plus or minus 10 on a 12 bit minicomputer. The exhaustive test requires about 64 x 10 to the 9th power cases and is infeasible. The ensuing discussion focusses on how to choose a good non exhaustive test by an appropriate choice of test points in (1) Parameter space, (2) Solution space, (3) Pathspace. (Author)

Descriptors :   *Computer programs, *Reliability, Errors, Test methods, Minicomputers

Subject Categories : Computer Programming and Software
      Computer Hardware

Distribution Statement : APPROVED FOR PUBLIC RELEASE