The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (2004 vol.53)
pp: 1330-1342
ABSTRACT
The problem of generating a checking experiment from a nondeterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites. This paper extends the notion of state counting in order to allow the input/output sequences observed in testing to be utilized: Adaptive state counting is introduced. The main benefit of the proposed approach is that it may result in a reduction in the size of the test suite used. An additional benefit is that, where a failure is observed, it is possible to terminate test generation at this point.
INDEX TERMS
Software engineering, software/program verification, testing and debugging, nondeterministic finite state machine, adaptive testing, state counting.
CITATION
Rob M. Hierons, "Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting", IEEE Transactions on Computers, vol.53, no. 10, pp. 1330-1342, October 2004, doi:10.1109/TC.2004.85
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool