Kopsavilkums
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.
| Oriģinālvaloda | Angļu |
|---|---|
| Lapas (no-līdz) | 60-66 |
| Lapu skaits | 7 |
| Žurnāls | IEEE Transactions on Software Engineering |
| Sējums | SE-5 |
| Izdevuma numurs | 1 |
| DOIs | |
| Publikācijas statuss | Publicēts - janv. 1979 |
Nospiedums
Uzziniet vairāk par pētniecības tēmām “SMOTL-A System to Construct Samples for Data Processing Program Debugging”. Kopā tie veido unikālu nospiedumu.Citēt šo
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver