EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


6937 A Semantic Framework for Test Coverage
Home Policy Brochure Browse Search User Area Contact Help

Brandán Briones, L. and Brinksma, H. and Stoelinga, M.I.A. (2006) A Semantic Framework for Test Coverage. In: Automated Technology for Verification and Analysis, 23-26 Oct 2006. pp. 399-414. Lecture Notes in Computer Science 4218. Springer Verlag. ISBN 978-3-540-47237-7

Full text available as:

PDF
- Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
403 Kb

Official URL: http://dx.doi.org/10.1007/11901914_30

Exported to Metis

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.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
Research Group:EWI-FMT: Formal Methods and Tools
Research Program:CTIT-UBRICKS: Building Blocks for Ubiquitous Computing and Communication
Research Project:STRESS: Systematic Testing of Real-time Software Systems
ID Code:6937
Status:Published
Deposited On:19 October 2006
Refereed:Yes
International:Yes
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item