Information gain of black-box testing

Authors:
Linmin Yang;Zhe Dang;Thomas R. Fischer
Affiliations:
Washington State University, School of Electrical Engineering and Computer Science, 99164, Pullman, WA, USA;Washington State University, School of Electrical Engineering and Computer Science, 99164, Pullman, WA, USA;Washington State University, School of Electrical Engineering and Computer Science, 99164, Pullman, WA, USA
Venue:
Formal Aspects of Computing
Year:
2011

Citing 0
Cited 1

Typical Paths of a Graph

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract

For model-based black-box testing, test cases are often selected from the syntactic appearance of the specification of the system under test, according to a pre-given test data adequacy criterion. We introduce a novel approach that is semantics-based, independent of the syntactic appearance of the system specification. Basically, we model the system under test as a random variable, whose sample space consists of all possible behavior sets (with respect to the specification) over the known interface of the black-box. The entropy of the system is measured as the (Shannon) entropy of the random variable. In our criterion, the coverage of a test set is measured as the expected amount of entropy decrease (i.e. the expected amount of information gained) once the test set is run. Since our criterion is syntactic independent, we study the notion of information-optimal software testing where, within a given constraint, a test set is selected to gain the most information.