||Chanson, Samuel T.
||Proceedings of the 13th IEEE INFOCOM, Toronto, Canada, 1994, June, p. 792-799
||In this paper, an automatic protocol test case generator which generates both test sequence and test data is presented. The underlying model is an extended finite state machine (EFSM) and Estelle is used as the formal description language. First, test sequences are generated using a combined control and data flow testing method. A set of path conditions associated with each test sequence is obtained using symbolic execution techniques. By solving the path conditions as a group of constraints, test data are then automatically generated. A prototype system implementing the above procedures has been built. The system has been used to generate test cases for real protocols such as TP0, FDDI and LAPB, and has been integrated in the UBC protocol testing environment.
||© 1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Files in this item: