##plugins.themes.academic_pro.article.main##

Abstract

Describes the structural methods of testing programs such as branch testing, program verification, symbolic testing and the generation of structural tests. An algorithm for the minimum coverage of the program graph based on a packaged adjacency matrix and a specific example of the minimum coverage of the program graph are introduced

Keywords

testing program graph minimum program graph coverage WHILE

##plugins.themes.academic_pro.article.details##

How to Cite
M.M. Arripov. (2022). Constructing the Minimum Coverage of the I Graph. Texas Journal of Engineering and Technology, 15, 89–93. Retrieved from https://zienjournals.com/index.php/tjet/article/view/3040

References

Read More