Minimizing the cost of fault location when testing from a finite state machine

Computer Communications

Volumn 22, Issue 2, 1999, Pages 120-127

  Hierons, Robert M ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Adaptive testing; Fault location; Finite state machine; Minimal length test

Indexed keywords

COMPUTATIONAL COMPLEXITY; FAILURE ANALYSIS; FINITE AUTOMATA; OPTIMIZATION; PROBLEM SOLVING;

FINITE STATE MACHINES (FSM); MINIMAL LENGTH TESTS;

SEQUENTIAL MACHINES;

EID: 0032630325     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(98)00251-5     Document Type: Article

References (16)

1. A.V. Aho, A.T. Dahbura, D. Lee, M.U. Uyar, An Optimization Technique for Protocol Conformance Test Generation Based on UIO Sequences and Rural Chinese Postman Tours, Proceedings of Protocol Model, Testing, and Verification VIII, IFIP 1988, pp. 75-86.
2. A.R. Cavalli, J.-P. Favreau, M. Philippou, Formal Methods in Conformance Testing: Results and Perspectives, Proceedings of Protocol Test Systems VI, IFIP, 1994, pp. 3-17.
3. Chow T.S. Testing Software Design Modelled by Finite State Machines. IEEE Transactions on Software Engineering. 4:(3):1978;178-187.
4. Fujiwara S., Bochmann G., Khendek F., Amalou M., Ghedamsi A. Test Selection Based on Finite State Models. IEEE Transactions on Software Engineering. 17:(6):1991;591-603.
5. A. Gibbons, Algorithmic Graph Theory, Cambridge University Press, Cambridge, 1985.
6. A. Ghedamsi, G. Von Bochmann, Test Result Analysis and Diagnosis for Finite State Machines, Proceedings of the 12th International Workshop on Protocol Test Systems, Yokohama, Japan, 1992, pp. 244-251.
7. A. Ghedamsi, G. Von Bochmann, R. Dssouli, Multiple Fault Diagnosis for Finite State Machines, Proceedings of IEEE INFOCOM'93, 1993, pp. 782-791.
8. Hierons R.M. Extending test sequence overlap by invertibility. The Computer Journal. 39:(4):1997;325-330.
9. R.M. Hierons, Testing from a finite state machine: extending invertibility to sequences, The Computer Journal 40 (4) (1997).
10. Huang C.-M., Hsu J.-M. An incremental protocol verification method. The Computer Journal. 37:(8):1994;698-710.
11. Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill, New York, 1978.
12. Lenstra J.K., Rinnooy Kan A.H.G. On general routing problems. Networks. 6:1976;273-280.
13. Petrenko A., von Bochmann G., Dssouli R. Conformance relations and test derivation. Proceedings of Protocol Test Systems VI. C-19:1994;157-178.
14. Petrenko A., Yevtushenko N., Lebedev A., Das A. Nondeterministic state machines in protocol conformance testing. Proceedings of Protocol Test Systems VI. C-19:1994;363-378.
15. Sidhu D., Leung T.-K. Experience with test generation for real protocols. ACM SIGCOMM. 88:1988;257-261.
16. B. Yang, H. Ural, Protocol Conformance Test Generation Using Multiple UIO Sequences with Overlap, SIGCOMM 90, Communications, Architectures and Protocols, 1990, pp. 118-125.