International Symposium on Automated Technology for Verification and Analysis

ATVA 2006: Automated Technology for Verification and Analysis pp 399-414

A Semantic Framework for Test Coverage

  • Laura Brandán Briones
  • Ed Brinksma
  • Mariëlle Stoelinga
Conference paper

DOI: 10.1007/11901914_30

Volume 4218 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Briones L.B., Brinksma E., Stoelinga M. (2006) A Semantic Framework for Test Coverage. In: Graf S., Zhang W. (eds) Automated Technology for Verification and Analysis. ATVA 2006. Lecture Notes in Computer Science, vol 4218. Springer, Berlin, Heidelberg

Abstract

Since testing is inherently incomplete, test selection has vital importance. Coverage measures evaluate the quality of a test suite and help the tester select test cases with maximal impact at minimum cost. Existing coverage criteria for test suites are usually defined in terms of syntactic characteristics of the implementation under test or its specification. Typical black-box coverage metrics are state and transition coverage of the specification. White-box testing often considers statement, condition and path coverage. A disadvantage of this syntactic approach is that different coverage figures are assigned to systems that are behaviorally equivalent, but syntactically different. Moreover, those coverage metrics do not take into account that certain failures are more severe than others, and that more testing effort should be devoted to uncover the most important bugs, while less critical system parts can be tested less thoroughly.

This paper introduces a semantic approach to black box test coverage. Our starting point is a weighted fault model (or WFM), which augments a specification by assigning a weight to each error that may occur in an implementation. We define a framework to express coverage measures that express how well a test suite covers such a specification, taking into account the error weight. Since our notions are semantic, they are insensitive to replacing a specification by one with equivalent behaviour. We present several algorithms that, given a certain minimality criterion, compute a minimal test suite with maximal coverage. These algorithms work on a syntactic representation of WFMs as fault automata. They are based on existing and novel optimization problems. Finally, we illustrate our approach by analyzing and comparing a number of test suites for a chat protocol.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Laura Brandán Briones
    • 1
  • Ed Brinksma
    • 1
    • 2
  • Mariëlle Stoelinga
    • 1
  1. 1.Faculty of Computer ScienceUniversity of TwenteThe Netherlands
  2. 2.Embedded Systems InstituteThe Netherlands