Abstract
This paper presents an incremental method for automatic executable test case and test sequence generation for a protocol modeled as communicating extended finite state machines (CEFSMs) with asynchronous communication. Instead of testing the protocol by computing the product of all CEFSMs, we test it by incrementally computing a partial product for each CEFSM C, taking into account only transitions which influence (or are influenced by) C, and generating test cases for it. The partial product for C represents the behavior of C when composed with parts of the other CEFSMs. Experimental results show that this method can be applied to systems of practical size. We also propose a method which reduces the size of the product machine for certain systems.
This work is supported by a Nortel grant.
Chapter PDF
References
C. Bourhfir, R. Dssouli, E. Aboulhamid, N. Rico (1997), “Automatic executable test case generation for EFSM specified protocols”, IWTCS, Chapman Hall pp. 75–90.
Chanson, S. T. and Zhu, J.(1993) A Unified Approach to Protocol Test Sequence Generation. In Proc. IEEE INFOCOM.
E. W. Dijkstra (1959), “A note on two problems in connection with graphs”, Numer. Math. 1 pp. 269–271.
M. G. Gouda, Y. T. Yu (1984), “Protocol Validation by Maximal Progressive Exploration”, IEEE Trans. on Comm. Vol. 32, No. 1, January.
Huang, C.M. Lin, Y.C. and Jang, M.Y. (1995) An Executable Protocol Test Sequence Generation Method for EFSM-Specified Protocols (IWPTS), Evry, 4–6 September.
David Lee, Krishan K. Sabnani, David M. Kristol, Sanjoy Paul (1996), “Conformance Testing of Protocols Specified as Communicating Finite State Machines- A Guided Random Walk Based Approach”, IEEE Trans. on Comm. Vol. 44, No. 5, May.
Monien, B. (1983) “The complexity of determining paths of length k”, Proc. Int. Workshop on Graph Theoretical Concepts in Computer Science, Trauner B Verlag, Linz, 241–251.
A. Petrenko, N. Yevtushenko, G. Bochmann, R. Dssouli (1997), “Testing in context: framework and test derivation”, a Special Issue on Protocol Engineering of Computer Communication.
J. Rubin, C. H. West (1982), “An Improved Protocol Validation Technique”, Computer Networks, 6, April.
Ural, H. and Yang. B. (1991) A Test Sequence Selection Method for Protocol Testing. IEEE Transactions on Communication, Vol 39, No4, April.
K.Sabnani, A.Dahbura (1985), “A new Technique for Generating Protocol Tests”, ACM Comput. Commun. Rev. Vol 15, No 4, September.
Watanabe (1981), “A fast algorithm for finding all shortest paths”, Inform. Process. Lett. 13, 1–3.
Weyuker, E.J. and Rapps, S. (1985) Selecting Software Test Data using Data Flow Information. IEEE Transactions on Software Engineering, April.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bourhfir, C., Dssouli, R., Aboulhamid, E., Rico, N. (1998). A guided incremental test case generation procedure for conformance testing for CEFSM specified protocols. In: Petrenko, A., Yevtushenko, N. (eds) Testing of Communicating Systems. IFIP — The International Federation for Information Processing, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35381-4_17
Download citation
DOI: https://doi.org/10.1007/978-0-387-35381-4_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6703-2
Online ISBN: 978-0-387-35381-4
eBook Packages: Springer Book Archive