Constructing the Minimum Coverage of the I Graph
loading.default
item.page.date
item.page.authors
item.page.journal-title
item.page.journal-issn
item.page.volume-title
item.page.publisher
Zien Journals
item.page.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