Name
Abstract | ||
|---|---|---|
A long-standing problem when testing from a deterministic finite state machine is to guarantee full fault coverage even if the faults introduce extra states in the implementations. It is well known that such tests should include the sequences in a traversal set which contains all input sequences of length defined by the number of extra states. This paper suggests the SPY method, which helps reduce the length of tests by distributing sequences of the traversal set and reducing test branching. It is also demonstrated that an additional assumption about the implementation under test relaxes the requirement of the complete traversal set. The results of the experimental comparison of the proposed method with an existing method indicate that the resulting reduction can reach 40%. Experimental results suggest that the additional assumption about the implementation can help in further reducing the test suite length. Copyright © 2011 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1002/stvr.452 | Softw. Test., Verif. Reliab. |
Keywords | Field | DocType |
extra state,test length,complete traversal set,additional assumption,existing method,experimental comparison,traversal set,test suite length,spy method,finite state machines | Test suite,Tree traversal,Fault coverage,Computer science,Deterministic finite automaton,Implementation under test,Algorithm,Finite-state machine,Branching (version control) | Journal |
Volume | Issue | ISSN |
22 | 6 | 0960-0833 |
Citations | PageRank | References |
12 | 0.64 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adenilso Simão | 1 | 26 | 1.87 |
| A. Petrenko | 2 | 565 | 31.37 |
| Nina Yevtushenko | 3 | 664 | 63.45 |