Adaptive testing of a deterministic implementation against a nondeterministic finite state machine

被引:31
作者
Hierons, RM [1 ]
机构
[1] Univ London Goldsmiths Coll, Dept Math & Comp Sci, London SE14 6NW, England
关键词
D O I
10.1093/comjnl/41.5.349
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A number of authors have looked at the problem of deriving a checking experiment from a nondeterministic finite state machine that models the required behaviour of a system. We show that these methods can be extended if it is known that the implementation is equivalent to same (unknown) deterministic finite state machine. When testing a deterministic implementation, the test output provides information about the implementation under test and can thus guide future testing. The use of an adaptive test process is thus proposed.
引用
收藏
页码:349 / 355
页数:7
相关论文
共 13 条
[1]  
Aho A. V., 1988, P IEEE 8 INT S PROT, P75
[2]   TESTING SOFTWARE DESIGN MODELED BY FINITE-STATE MACHINES [J].
CHOW, TS .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1978, 4 (03) :178-187
[3]   Testing from a finite-state machine: Extending invertibility to sequences [J].
Hierons, RM .
COMPUTER JOURNAL, 1997, 40 (04) :220-230
[4]   Extending test sequence overlap by invertibility [J].
Hierons, RM .
COMPUTER JOURNAL, 1996, 39 (04) :325-330
[5]  
HIERONS RM, 1997, J SOFTWARE TESTING V, V7, P19
[6]  
Larsen P., 1993, LNCS, V670, P268
[7]  
PETRENKO A, 1994, IFIP TRANS C, V19, P363
[8]   FINITE AUTOMATA AND THEIR DECISION PROBLEMS [J].
RABIN, MO ;
SCOTT, D .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1959, 3 (02) :114-125
[9]  
SIDHU D, 1988, ACM SIGCOMM 88, P257
[10]  
Tanenbaum A.D.W., 1996, COMPUT NETW