Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine

Computer Journal

Volumn 41, Issue 5, 1998, Pages 349-355

  Hierons, R M ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER TESTING; FINITE AUTOMATA; MATHEMATICAL MODELS;

NONDETERMINISTIC FINITE STATE MACHINES (NFSM);

SEQUENTIAL MACHINES;

EID: 0032288306     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/41.5.349     Document Type: Article

References (14)

1. Tanenbaum, A. S. (1996) Computer Networks (3rd edn). Prentice Hall, International Editions.
2. Rabin, M. O. and Scott, D. (1959) Finite automata and their decision problems. IBM J. Res. Develop., 3, 114-125.
3. Dick, J. and Faivre, A. (1993) Automating the generation and sequencing of test cases from model-based specifications. FME '93, First Int. Symp. on Formal Methods in Europe. Odense, Denmark, 19-23 April 1993, pp. 268-84. Lecture Notes in Computer Science, 670. Springer-Verlag.
4. Hierons, R. M. (1997) Testing from a Z specification. J. Software Testing, Verification, and Reliability, 7, 19-33.
5. Sidhu, D. and Leung, T. K. (1988) Experience with test generation for real protocols. ACM SIGCOMM 88, pp. 257-261. ACM Press.
6. Chow, T. S. (1978) Testing software design modelled by finite state machines. IEEE Trans. Software Eng., 4, 178-187.
7. Aho, A. V., Dahbura, A. T., Lee, D. and Uyar, M. U. (1988) An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours. Proc. Protocol Specification, Testing, and Verification VlII, pp. 75-86. North-Holland, Atlantic City.
8. Yang, B. and Ural, H. (1990) Protocol conformance test generation using multiple UIO sequences with overlapping. ACM SlGCOMM 90: Communications, Architectures, and Protocols, Sept 24-27, pp. 118-125. North-Holland, Twente, Netherlands.
9. Hierons, R. M. (1996) Extending test sequence overlap by invertibility. Comp. J., 39, 325-330.
10. Ural, H., Wu, X. and Zhang, F. (1997) On minimizing the lengths of checking sequences. IEEE Trans. Comput., 46, 93-99.
11. Hierons, R. M. (1997) Testing from a finite state machine: extending invertibility to sequences. Comp. J., 40, 220-230.
12. Luo, G., Bochmann, G. V. and Petrenko, A. (1994) Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method. IEEE Trans. Software Eng., 20, 149-161.
13. Petrenko, A., Yevtushenko, N., Lebedev, A. and Das, A. (1994) Nondeterministic state machines in protocol conformance testing. Proc. of Protocol Test Systems. VI(C-19), Pau, France, September 28-30, pp. 363-378. Elsevier Science BV (North-Holland).
14. Yevtushenko, N. V., Lebedev, A. V. and Petrenko, A. F. (1991) On checking experiments with nondeterministic automata. Automatic Control Comput. Sci., 6, 81-85.