Abstract
The possibility of automatic construction of a complete set of program tests is considered. A test set system is said to be complete if every feasible program branch (segment) is executed by it. The complete test set construction algorithm for commercially oriented data processing programs is outlined, and the results of its functioning on real programs are analyzed.
| Original language | English |
|---|---|
| Pages (from-to) | 60-66 |
| Number of pages | 7 |
| Journal | IEEE Transactions on Software Engineering |
| Volume | SE-5 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 1979 |
Keywords
- Index Terms-Analysis of programs
- program testing
- program validation
- symbolic execution
- test data generation
Fingerprint
Dive into the research topics of 'SMOTL-A System to Construct Samples for Data Processing Program Debugging'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver