Analisis Terhadap Aliran Kendali Program  

Oleh:

Padmowati, Rosa de Lima Endang

Jenis: Article from Bulletin/Magazine
Dalam koleksi: Integral: Majalah Ilmiah Matematika dan Ilmu Pengetahuan Alam vol. 4 no. 1 (Apr. 1999), page 5-9.
Topik: trees; ddagraph; dominator tree; implied tree; path cover

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II48.1 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Program testing is based on the control flow of programs. In particular, branch testing requires that every branch in a program be exercised at least once, accordingly, a test path set must be selected from the potentially infinite execution paths. This paper presents an algorith that finds a path cover for a given program flowgraph. The analysis is conducted on a reduce flowgraph, called a ddgraph, and uses graph theoretic principles.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali