PEMBENTUKAN SET JALUR ALIRAN PROGRAM MENGGUNAKAN TEKNIK JUMLAH JALUR MINIMUM DAN TEKNIK JUMLAH PREDIKAT MINIMUM
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 DDGra...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institut Teknologi Sepuluh Nopember
2009-07-01
|
| Series: | JUTI: Jurnal Ilmiah Teknologi Informasi |
| Online Access: | http://juti.if.its.ac.id/index.php/juti/article/view/86 |
| Summary: | 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. |
|---|---|
| ISSN: | 1412-6389 2406-8535 |