论文信息 - Theories of Program Testing and the Application of Revealing Subdomains

Theories of Program Testing and the Application of Revealing Subdomains

The theory of test data selection proposed by Goodenough and Gerhart is examined. In order to extend and refine this theory, the concepts of a revealing test criterion and a revealing subdomain are proposed. These notions are then used to provide a basis for constructing program tests.

Elaine J. Weyuker | Thomas J. Ostrand | E. Weyuker | T. Ostrand

[1] Rod M. Burstall,et al. Program Proving as Hand Simulation with a Little Induction , 1974, IFIP Congress.

[2] Edsger W. Dijkstra,et al. Notes on structured programming , 1970 .

[3] Matthew M. Geller. Test data as an aid in proving program correctness , 1976, POPL.

[4] C. V. Ramamoorthy,et al. On the Automated Generation of Program Test Data , 1976, IEEE Transactions on Software Engineering.

[5] William E. Howden,et al. An evaluation of the effectiveness of symbolic testing , 1978, Softw. Pract. Exp..

[6] William E. Howden,et al. Symbolic Testing and the DISSECT Symbolic Evaluation System , 1977, IEEE Transactions on Software Engineering.

[7] William E. Howden,et al. Reliability of the Path Analysis Testing Strategy , 1976, IEEE Transactions on Software Engineering.

[8] Richard J. Lipton,et al. Hints on Test Data Selection: Help for the Practicing Programmer , 1978, Computer.