Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

LSU Doctoral Dissertations

Theses/Dissertations

2003

Node coverage

Articles 1 - 1 of 1

Full-Text Articles in Entire DC Network

Level Of Essentialness Of A Node In Flowcharts And Its Application To Program Testing, Osman Kandara Jan 2003

Level Of Essentialness Of A Node In Flowcharts And Its Application To Program Testing, Osman Kandara

LSU Doctoral Dissertations

Program testing is important to develop bug free software. A common form of program testing involves selecting test cases which execute (cover) a given set W of statements in the program. In regression testing, W typically forms a small subset of the program. It is often possible to find an alternate small set W so that execution of W' implies execution of W. We develop concepts and algorithms for finding W' as small as possible with the condition that the statements in W' are "close" to those in W in terms of program structure. These concepts generalize the notion of …