Structural Testing Based on Minimum Kernels

Structural testing techniques, such as statement and branch coverage, play an important role in improving dependability of software systems. However, finding a set of tests which guarantees high coverage is a time-consuming task. In this paper we present a technique for structural testing based on kernel computation. A kernel satisfies the property that any set of tests which executes all vertices (edges) of the kernel executes all vertices (edges) of the program’s flowgraph. We present a linear-time algorithm for computing minimum kernels based on pre- and postdominator relations of a flowgraph.

• Type: Conference
• Year: 2005
• Where: DATE
• Authors: Elena Dubrova
• Keywords: Branch Coverage, DATE 2005, Hardware, Structural Testing, Structural Testing Techniques