A Reduced Test Suite for Protocol Conformance Testing

ACM Transactions on Software Engineering and Methodology (TOSEM)

Volumn 3, Issue 3, 1994, Pages 201-220

  Bernhard, Philip J ^a  

^a Harris Space Systems Corporation ^*  (United Kingdom)

Author keywords

heuristics

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE SELECTION AND EVALUATION; HEURISTIC METHODS; OPTIMIZATION; PERFORMANCE; PROGRAM DEBUGGING; RELIABILITY; SEQUENTIAL MACHINES;

CHARACTERIZATION SET; PERFORMANCE RATIO; PROTOCOL CONFORMANCE TESTING; TEST DATA GENERATORS; VERIFICATION;

NETWORK PROTOCOLS;

EID: 0028478618     PISSN: 1049331X     EISSN: 15577392     Source Type: Journal    
DOI: 10.1145/196092.196088     Document Type: Article

References (19)

1. BOOCH, G. 1991. Object Oriented Design With Applications. The Benjamin/Cummings Publishing Company, Inc., Menlo Park, Calif.
2. CHEN, M. S., CHOI, Y., AND KERSHENBAUM, A. 1990. Approaches utilizing segment overlap to minimize test sequences. In Protocol Specification, Testing and Verification. Elsevier Science Publishers B.V., North-Holland, Amsterdam, 85-98.
3. CHOW, T. S. 1978. Testing software design modeled by finite-state machines. IEEE Trans. Softw. Eng. SE-4, 3 (May), 178-187.
4. DAHBURA, A. T., SABNANI, K., AND UYAR, M. U. 1990. Formal methods for generating protocol conformance test sequences. Proc. IEEE (Aug.), 1317-1326.
5. FUJIWARA, S., BOCHMANN, G. V., KHENDEK, F., AMALOU, M., AND GHEDAMSI, A. 1991. Test selection based on finite state models. IEEE Trans. Softw. Eng. 17, 6 (June), 591-603.
6. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability. W. H. Freeman and Company, New York.
7. GILL, A. 1962. Introduction to the Theory of Finite-State Machines. McGraw-Hill, New York.
8. GONENC, G. 1970. A method for the design of fault detection experiments. IEEE Trans. Comput. C-19, 6 (June), 551-558.
9. HENNIE, F. C. 1968. Finite-State Models for Logical Machines. John Wiley & Sons, New York.
10. HOPCROFT, J. E. AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass.
11. HOWDEN, W. 1987. Software Engineering and Technology: Functional Program Testing and Analysis. McGraw-Hill, New York.
12. JOHNSON, D. S. 1974. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256-278.
13. MOORE, E. F. 1956. Gedanken-experiments on sequential machines. In Automata Studies. Princeton Univ. Press, Princeton, N.J. Ann. Math. Stud. 34, 1, 129-153.
14. MILLER, R. E. AND PAUL, S. 1991. Generating minimal length test sequences for conformance testing of communication protocols. In INFOCOM. 970-979.
15. NAITO, S AND TSUNOYAMA, M 1981. Fault detection for sequential machines by transition tours. In IEEE Fault Tolerant Computing Conference. IEEE, New York.
16. SABNANI, K. AND DAHBURA, A. 1988. A protocol test generation procedure. Comput. Netw. ISDN Syst. 15, 4, 285-297
17. SIDHU, D. P. AND LEUNG, T K. 1989. Formal methods for protocol testing: A detailed study. IEEE Trans. Softw. Eng. 15, 4 (Apr.), 413-426.
18. VASILKEVSKII, M. P. 1973. Failure diagnosis of automata. Kibernetika 4, (July-Aug.), 98-108.
19. YANNAKAKIS, M AND LEE, D. 1988. Testing finite state machines. In 23rd STOC (New Orleans, La., May). 476-485.