Testing in context: Framework and test derivation

Computer Communications

Volumn 19, Issue 14, 1996, Pages 1236-1249

  Petrenko, Alexandre ^a   Yevtushenko, Nina ^b   Bochmann, Gregor V ^a   Dssouli, Rachida ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b TOMSK STATE UNIVERSITY   (Russian Federation)

Author keywords

Communicating FSMs; Communication protocols; Conformance testing

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER NETWORKS; COMPUTER SIMULATION; EQUIVALENCE CLASSES; FINITE AUTOMATA;

COMMUNICATING FINITE STATE MACHINE; CONFORMANCE TESTING; SPECIFICATION IN CONTEXT; TESTING IN CONTEXT;

NETWORK PROTOCOLS;

EID: 0030362231     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(96)01157-7     Document Type: Article

References (36)

1. A. Petrenko, G. Bochmann and R. Dssouli, Conformance relations and test derivation, IFIP Trans. Protocol Test Systems VI (Proc. IFIP TC6 Fifth Int. Workshop on Protocol Test Systems 1993), North-Holland, 1994, pp. 157-178.
2. P.H. Starke, Abstract Automata, North-Holland/American Elsevier, 1972.
3. A. Petrenko, N. Yevtushenko, A. Lebedev and A. Das, Nondeterministic state machines in protocol conformance testing, IFIP Trans. Protocol Test Systems VI (Proc. IFIP TC6 Fifth Int. Workshop on Protocol Test Systems 1993), North-Holland, 1994, pp. 363-378.
4. S.H. Unger, Asynchronous Sequential Switching Circuits, Wiley-Interscience, 1969.
5. G. v Bochmann and A. Petrenko, Protocol testing: review of methods and relevance for software testing, ISSTA'94 ACM Int. Symposium on Software Testing and Analysis, 1994, pp. 109-124.
6. G. v Bochmann, A. Petrenko and M. Yao, Fault coverage of tests based on finite state models, Protocol Test Systems VII (Proc. IFIP WG 6.1 Int. Workshop on Protocol Test Systems, Chapman & Hall, 1995, pp. 55-78.
7. A. Petrenko and G. v Bochmann, On fault coverage of tests for finite state specifications, Computer Networks & ISDN Systems, 1996.
8. D.P. Sidhu and T.K. Leung, Formal methods for protocol testing: a detailed study, IEEE Trans. Softw. Eng., SE-15(4) (1989) 413-426.
9. C.H. West, An automated technique of communication protocols validation, IEEE Trans. Comm., 26 (1978) 1271-1275.
10. G. v Bochmann and C.A. Sunshine, Formal methods in communication protocol design, IEEE Trans. Comm., 28 (1980) 624-631.
11. P. Merlin and G. v Bochmann, On the construction of submodule specifications and communications protocols, ACM Trans. Programming Languages and Systems, 5(1) (1983) 1-25.
12. G. Luo, G. v Bochmann and A. Petrenko, Test selection based on communicating nondeterministic finite state machines using a generalized Wp-method, IEEE Trans. Softw. Eng., SE-20(2) (1994) 149-162.
13. D. Brand and P. Zafiropulo, On communicating finite state machines, J. ACM, 30(2) (1983) 323-342.
14. L. Heerink and E. Brinksma, Validation in context, Proc. 15th IFIP WG6.1 Int. Symposium on Protocol Specification, Testing, and Verification, Chapman & Hall, 1995, pp. 221-236.
15. H. v Dam, H. Kloosterman and E. Kwast, Test derivation for standardized test methods, IFIP Trans. Protocol Test Systems IV (Proc. IFIP TC6 Fourth Int. Workshop on Protocol Test Systems 1991, 1992, pp. 69-82.
16. ISO/IEC JTC1/SC21 WG7, Formal methods in conformance testing, working draft, Project 1.21.54. ISO, February 1995.
17. M.P. Vasilevski, Failure diagnosis of automata, Cybernetics, Plenum, New York, No 4, 1973, pp. 653-665.
18. T.S. Chow, Testing software design modeled by finite-state machines, IEEE Trans. Softw. Eng., SE-4(3) (1978) 178-187.
19. J. Kim and M. Newborn, The simplification of sequential machines with input restrictions, IEEE Trans. Computers, C-21(12) (1972) 1440-1443.
20. N. Yevtushenko and A. Matrosova, On one approach to automata networks checking sequences construction, Automatic Control and Computer Sciences, Allerton Press, New York, Vol 25 No 2, 1991, p. 3-7.
21. A. Petrenko, N. Yevtushenko and R. Dssouli, Testing strategies for communicating fsms, Protocol Test Systems VII (Proc. IFIP WG 6.1 Int. Workshop on Protocol Test Systems 1994, Chapman & Hall, 1995, pp. 193-208.
22. Y. Watanabe and R.K. Brayton, The maximal set of permissible behaviors for fsm networks, Proc. IEEE.ACM Int. Conf. on Computer-Aided Design, 1993, pp. 316-320.
23. R. Dssouli and G. v Bochmann, Conformance testing with multiple observers, Proc. IFIP 6th Int. Symposium on Protocol Specification, Testing, and Verification, 1986.
24. D. Lee, K. Sabnani, D. Krispot, S. Paul and M. Uyar, Conformance testing of protocols specified as communicating fsms, INFOCOM, 1993, pp. 115-127.
25. A. Petrenko, N. Yevtushenko and G. v Bochmann, Experiments on nondeterministic systems for the reduction relation, Technical Report 932, Université de Montréal, 1994.
26. J. Parrow, Submodule construction as equation solving in ccs, Theoretical Computer Science, 68 (1989) 175-202.
27. K.G. Larsen and L. Xinxin, Compositionality through an operational semantics in contexts, Lecture Notes in Computer Science, 443 (1990) 526-539.
28. H. Qin and P. Lewis, Factorization of finite state machines under strong and observational equivalences, Formal Aspects of Computing (1991) 285-307.
29. K. Drira, P. Azema, B. Soulas and A.M. Chemali, Testability of a communicating system through an environment, Proc. TAPSOFT, 1993, pp. 329-341.
30. P. Das and D.E. Farmer, Fault-detection experiments for parallel-decomposable sequential machines, IEEE Trans. Computers, C-24(11) (1975) 1104-1109.
31. S. Devadas, Approaches to multi-level sequential logic synthesis, Proc. 26th Design Automation Conf., Las Vegas, 1989, pp. 270-276.
32. J.-K. Rho, G. Hachtel and F. Somenzi, Don't care sequences and the optimization of interacting finite state machines, Proc. IEEE Int. Conf. on Computer Aided Design, Santa Clara, 1991, pp. 414-421.
33. A. Petrenko and N. Yevtushenko, Test suite generation for a fsm with a given type of implementation errors, IFIP Trans. Protocol Specification, Testing, and Verification XII (Proc. IFIP TC6 12th Int. Symposium on Protocol Specification, Testing, and Verification, 1992. pp. 229-243.
34. H.Y. Wang and R.K. Brayton, Input don't care sequences in fsm networks, Proc. IEEE/ACM Int. Conf. Computer-Aided Design, 1993. pp. 321-328.
35. Y. Watanabe and R.K. Brayton, State minimization of pseudo nondeterministic fsm's, Proc. Euro. Design and Test Conference, 1994, pp. 184-191.
36. M. Damiani, Nondeterministic finite state machines and sequential don't cares, Proc. Euro. Design and Test Conf., 1994, 192-198.