Pembentukan Set Jalur Aliran Program Menggunakan Teknik Jumlah Jalur Minimum Dan Teknik Jumlah Predikat Minimum
Year: 2009
Type: article
Abstract: Structured testing is based on the control flow of programs. The analysis of the control flow of program is conducted on a reduced flowgraph, called a decision-to-decision graph (DDGraph). The relations of dominance and implication between arcs enable to immediate identification of a subset of DDGraph arcs. These arcs are called unconstrained arcs, which have a property that, when the unconstrained arcs are exercised, the traversal of all the other arcs are guaranteed. In order to find a path cover for given program flowgraph, there are two methods: minimum number of paths technique and less pred technique.
Author: Rosa de Lima Endang Padmowati
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2006921705
