PEMBENTUKAN SET JALUR ALIRAN PROGRAM MENGGUNAKAN TEKNIK JUMLAH JALUR MINIMUM DAN TEKNIK JUMLAH PREDIKAT MINIMUM
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.Downloads
Downloads
Published
Issue
Section
License
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in JUTI unless they receive approval for doing so from the Editor-in-Chief.
JUTI open access articles are distributed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.
