Heuristics for Faster Error Detection With Automated Black Box Testing

Authors:
Antti Kervinen;Pablo Virolainen
Affiliations:
Tampere University of Technology, Institute of Software Systems, PO Box 553, FIN-33101 Tampere, FINLAND;Tampere University of Technology, Institute of Software Systems, PO Box 553, FIN-33101 Tampere, FINLAND
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 10
Cited 2

A protocol test generation procedure

Computer Networks and ISDN Systems
Test Selection Based on Finite State Models

IEEE Transactions on Software Engineering
Art of Software Testing

Art of Software Testing
Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method

IEEE Transactions on Software Engineering
Formal Test Automation: A Simple Experiment

Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
Test Selection, Trace Distance and Heuristics

TestCom '02 Proceedings of the IFIP 14th International Conference on Testing Communicating Systems XIV
Exploration Testing

ACSD '01 Proceedings of the Second International Conference on Application of Concurrency to System Design
Specification Coverage Aided Test Selection

ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
Merging State-Based and Action-Based Verification

ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
Testing Software Design Modeled by Finite-State Machines

IEEE Transactions on Software Engineering

Making model-based testing more agile: a use case driven approach

HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Model-Based testing through a GUI

FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Three building blocks for test guidance algorithms, the step evaluation, the state evaluation and the evaluation order, are proposed in this paper. We show how a simple family of coverage criteria can be used to evaluate individual testing steps, and how the nondeterministic behaviour of the tested system can be handled and longer term test step plans created with the state evaluation. We use the evaluation order to de ne which and when states are evaluated. Six heuristic algorithms based on these ideas are implemented. Four of them use a game-like approach to black box testing. In addition, three other test guidance algorithms are implemented for comparison. The algorithms are compared by measuring the number of testing steps required for detecting errors that are in ltrated to the conference protocol systems of two different sizes.