Document Type

Conference Proceeding

Publisher

IEEE

Faculty

Computing, Health and Science

School

School of Computer and Information Science

RAS ID

3065

Comments

This conference paper was originally published as: Wang, J. , Xiao, J. , Lam, C. P., & Li, H. (2005). A Bipartite Graph Approach to Generate Optimal Test Sequences for Protocol Conformance Testing using the Wp-method. Proceedings of 12th Asia-Pacific Software Engineering Conference. (pp. 307-314). Taipei, Taiwan. IEEE.

© 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Abstract

Conformance testing using test sequences is used to ensure that a protocol implementation conforms to its specification. A commonly used technique to generate test sequences for specifications described by the finite state machines is the Wp-method with the Reset technique, which frequently results in long test sequences. In this paper, we propose a bipartite graph approach to generate optimal test sequences for protocol conformance testing. Our approach significantly reduces the length of the test sequences required for conformance testing while maintaining the same fault detection capability.

Access Rights

free_to_read

 
COinS