Reducing the complexity of finite state machine test generation using combinatorial designs

作者: Sergey Olvovsky , Andrei Kirshin , Alan Hartman , Kenneth Nagin

DOI:

关键词:

摘要: A design verification system generates a small set of test cases, from finite state machine model the application under test. The is reduced by creating efficient samples inputs to which are prepared combinatorial input parameter selection. cases generated traversal machine, and tests interacting combinations parameters in an way. technique integrated into generator based on machine. Using extended language, partial rulesets employed instruct automatically employ selection during generation. Another for case generation disclosed, uses algorithms guarantee coverage aspect interaction between stimuli at different stages or transitions case.

参考文章(19)
Siddhartha Ramanlal Dalal, Gardner Conde Patton, David Mordecai Cohen, Michael Lawrence Fredman, Method and system for automatically generating efficient test cases for systems having interacting elements ,(1995)
Mark Edward Trumpler, Lois Scirocco Elkind, Ronald Allen Kita, Method and apparatus for testing implementations of software specifications ,(1996)
Yu Lei, K.C. Tai, In-parameter-order: a test generation strategy for pairwise testing high assurance systems engineering. pp. 254- 261 ,(1998) , 10.1109/HASE.1998.731623
Sergey Olvovsky, Andrei Kirshin, Alan Hartman, Aviad Zlotnick, Kenneth Nagin, Model based test generation for validati on of parallel and concurrent software ,(2002)
Tang, Woo, Exhaustive Test Pattern Generation with Constant Weight Vectors IEEE Transactions on Computers. ,vol. 32, pp. 1145- 1150 ,(1983) , 10.1109/TC.1983.1676175