Constructing the Minimum Coverage of the I Graph

dc.contributor.author	M.M. Arripov
dc.date.accessioned	2026-01-01T10:46:54Z
dc.date.issued	2022-12-21
dc.description.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
dc.format	application/pdf
dc.identifier.uri	https://zienjournals.com/index.php/tjet/article/view/3040
dc.identifier.uri	https://asianeducationindex.com/handle/123456789/60697
dc.language.iso	eng
dc.publisher	Zien Journals
dc.relation	https://zienjournals.com/index.php/tjet/article/view/3040/2535
dc.rights	https://creativecommons.org/licenses/by-nc/4.0
dc.source	Texas Journal of Engineering and Technology; Vol. 15 (2022): TJET; 89-93
dc.source	2770-4491
dc.subject	testing
dc.subject	program graph
dc.subject	minimum program graph coverage
dc.subject	WHILE
dc.title	Constructing the Minimum Coverage of the I Graph
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	Peer-reviewed Article

item.page.files

pagination.showing.labelpagination.showing.detail

item.page.filesection.name: arripov_2022_constructing_the_minimum_coverage_of_the.pdf
item.page.filesection.size: 210.61 KB
item.page.filesection.format: Adobe Portable Document Format