On reducing test length for FSMs with extra states
Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
---|---|
Data(s) |
06/11/2013
06/11/2013
2012
|
Resumo |
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 (C) 2011 John Wiley & Sons, Ltd. NSERC NSERC [OGP0194381] Brazilian funding agency CNPq Brazilian Funding Agency CNPq [305236/2009-1, 474152/2010-3] Russian Foundation for Basic Research Russian Foundation for basic research [10-08-92003-HHC_a] |
Identificador |
SOFTWARE TESTING VERIFICATION & RELIABILITY, HOBOKEN, v. 22, n. 6, Special Issue, supl. 1, Part 3, pp. 435-454, SEP, 2012 0960-0833 http://www.producao.usp.br/handle/BDPI/42243 10.1002/stvr.452 |
Idioma(s) |
eng |
Publicador |
WILEY-BLACKWELL HOBOKEN |
Relação |
SOFTWARE TESTING VERIFICATION & RELIABILITY |
Direitos |
closedAccess Copyright WILEY-BLACKWELL |
Palavras-Chave | #TEST GENERATION #FINITE STATE MACHINES #FAULT DOMAIN #CHECKING SEQUENCES #MACHINES #DESIGN #ENGENHARIA DE SOFTWARE #SISTEMAS DE INFORMAÇÃO #COMPUTER SCIENCE, SOFTWARE ENGINEERING |
Tipo |
article original article publishedVersion |