Structural Testing Based on Minimum Kernels

Authors:
Elena Dubrova
Affiliations:
Royal Institute of Technology, IMIT/KTH, Sweden
Venue:
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Year:
2005

Citing 14
Cited 0

Software testing techniques (2nd ed.)

Software testing techniques (2nd ed.)
An Investigation of the Therac-25 Accidents

Computer
Dominators, super blocks, and program coverage

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
What's in a region?: or computing control dependence regions in near-linear time for reducible control flow

ACM Letters on Programming Languages and Systems (LOPLAS)
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs

IEEE Transactions on Software Engineering
A new, simpler linear-time dominators algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient coverage testing using global dominator graphs

Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Dominators in Linear Time

SIAM Journal on Computing
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Immediate predominators in a directed graph [H]

Communications of the ACM
Object code optimization

Communications of the ACM
Software Testing

Software Testing
Coverage Metrics for Functional Validation of Hardware Designs

IEEE Design & Test
A Comparison of Some Structural Testing Strategies

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 post-dominator relations of a flowgraph.