Jurnal
SINTA 2
PEMBENTUKAN SET JALUR ALIRAN PROGRAM MENGGUNAKAN TEKNIK JUMLAH JALUR MINIMUM DAN TEKNIK JUMLAH PREDIKAT MINIMUM
JUTI: Jurnal Ilmiah Teknologi Informasi · Vol. 7 No. 4 (2009) · hlm. 171–176
ISSN 2406-8535, 1412-6389
Terbit 2009-07-01
Penerbit Institut Teknologi Sepuluh Nopember
Bahasa eng
Abstrak
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.
Jaringan kolaborasi para penulis
Belum ada rekan penulis di Melola.
Sumber metadata: OAI-PMH (metadata jurnal) https://juti.if.its.ac.id/index.php/juti/oai, pertama di-harvest 26 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en">PEMBENTUKAN SET JALUR ALIRAN PROGRAM MENGGUNAKAN TEKNIK JUMLAH JALUR MINIMUM DAN TEKNIK JUMLAH PREDIKAT MINIMUM</dc:title>
<dc:creator xml:lang="en">Padmowati, Rosa de Lima Endang</dc:creator>
<dc:description xml:lang="en">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.</dc:description>
<dc:publisher xml:lang="en">Institut Teknologi Sepuluh Nopember</dc:publisher>
<dc:date>2009-07-01</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:type xml:lang="en">Peer-reviewed Article</dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>https://juti.if.its.ac.id/index.php/juti/article/view/86</dc:identifier>
<dc:identifier>10.12962/j24068535.v7i4.a86</dc:identifier>
<dc:source xml:lang="en">JUTI: Jurnal Ilmiah Teknologi Informasi; Vol 7, No 4, Juli 2009; 171-176</dc:source>
<dc:source>2406-8535</dc:source>
<dc:source>1412-6389</dc:source>
<dc:source>10.12962/j24068535.v7i4</dc:source>
<dc:language>eng</dc:language>
<dc:relation>https://juti.if.its.ac.id/index.php/juti/article/view/86/82</dc:relation>
</oai_dc:dc>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 26 Okt 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref, doaj.
Sitasi artikel ini
APA 7
Padmowati, R. d. L. E. (2009). PEMBENTUKAN SET JALUR ALIRAN PROGRAM MENGGUNAKAN TEKNIK JUMLAH JALUR MINIMUM DAN TEKNIK JUMLAH PREDIKAT MINIMUM. JUTI: Jurnal Ilmiah Teknologi Informasi, 7(4), 171–176. https://doi.org/10.12962/j24068535.v7i4.a86
Salin
IEEE
R. d. L. E. Padmowati, “PEMBENTUKAN SET JALUR ALIRAN PROGRAM MENGGUNAKAN TEKNIK JUMLAH JALUR MINIMUM DAN TEKNIK JUMLAH PREDIKAT MINIMUM,” JUTI: Jurnal Ilmiah Teknologi Informasi, vol. 7, no. 4, pp. 171–176, 2009, doi: 10.12962/j24068535.v7i4.a86.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.