State-space analysis as an aid to testing

Authors:
Michal Young
Affiliations:
Software Engineering Research Center, Department of Computer Sciences, Purdue University, West Lafayette, IN
Venue:
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Year:
1994

Citing 5
Cited 0

Compositional reachability analysis using process algebra

TAV4 Proceedings of the symposium on Testing, analysis, and verification
Test Selection Based on Finite State Models

IEEE Transactions on Software Engineering
Structural Testing of Concurrent Programs

IEEE Transactions on Software Engineering
What are race conditions?: Some issues and formalizations

ACM Letters on Programming Languages and Systems (LOPLAS)
Specification-based test oracles for reactive systems

ICSE '92 Proceedings of the 14th international conference on Software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Non-determinism makes testing concurrent software difficult. We consider how pre-run-time state-space analysis can be used to aid in testing implementations of concurrent software. State-space analysis techniques have the advantage in principle of exploring all possible execution histories, but they do not verify all properties of interest and in practice they may not accurately model program execution. Combining state-space analysis with testing can partially overcome the weaknesses of each. Using the state-space model in a test oracle is the simpler part: techniques based on classical automata theory are suitable for this. Covering all important non-deterministic executions is harder. We propose a pragmatic method for detecting unexecuted paths that are certainly executable and possibly important.