Theories of Program Testing and the Application of Revealing Subdomains
- 1 May 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-6 (3), 236-246
- https://doi.org/10.1109/tse.1980.234485
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- The applicability of program schema results to programsInternational Journal of Parallel Programming, 1979
- An evaluation of the effectiveness of symbolic testingSoftware: Practice and Experience, 1978
- Test data as an aid in proving program correctnessCommunications of the ACM, 1978
- Hints on Test Data Selection: Help for the Practicing ProgrammerComputer, 1978
- Symbolic Testing and the DISSECT Symbolic Evaluation SystemIEEE Transactions on Software Engineering, 1977
- On the Automated Generation of Program Test DataIEEE Transactions on Software Engineering, 1976
- Reliability of the Path Analysis Testing StrategyIEEE Transactions on Software Engineering, 1976