Verifiable coverage criteria for automated testing

Authors:
Sergey Baranov;Vsevolod Kotlyarov;Thomas Weigert
Affiliations:
St. Petersburg Inst. for Informatics and Automation of the Russian Academy of Sciences, St.Petersburg, Russia;Saint-Petersburg State Polytechnic University, St. Petersburg, Russia;Dept. of Computer Science, Missouri University of Science and Technology, Rolla, MO
Venue:
SDL'11 Proceedings of the 15th international conference on Integrating System and Software Modeling
Year:
2011

Citing 5
Cited 0

Managing the software process

Managing the software process
Software Testing Techniques

Software Testing Techniques
Guided Test Generation from CSP Models

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Generation of test purposes from Use Case Maps

Computer Networks: The International Journal of Computer and Telecommunications Networking - Telecommunications and UML languages
Basic protocols, message sequence charts, and the verification of requirements specifications

Computer Networks: The International Journal of Computer and Telecommunications Networking - Telecommunications and UML languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

A key question for system testing of a software product is how to determine that the semantics of its requirements is adequately realized in the given implementation, or alternatively to find a series of concrete counter-examples demonstrating the violation of (a) particular requirement(s). An adequate test suite will aid in this determination. This paper formulates three types of requirements coverage criteria to establish the adequacy of a test suite. The suggested approach to system testing was validated in a number of medium and large size industrial projects.