CONSTRUCTING THE MINIMUM COVERAGEOF THE I GRAPH

Authors

  • M. M. Arripov Candidate of Technical Sciences, Associate Professor of the Department of Informatics of the Kokand State Pedagogical Institute

DOI:

https://doi.org/10.17605/OSF.IO/D6RWC

Keywords:

testing, program graph, minimum program graph coverage, packed adjacency matrix, DD paths, vertex, branches

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.

Downloads

Published

2022-12-05

Issue

Section

Articles