Optimization problems from feature testing of communication protocols

Authors:
D. Lee;M. Yannakakis
Affiliations:
-;-
Venue:
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
Year:
1996

Citing 0
Cited 5

Testing hierarchical systems

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The Complexity of Coverage

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Automatic verification stimulus generation for interface protocols modeled with non-deterministic extended FSM

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
UIOE: a protocol test sequence generation method using the transition executability analysis (TEA)

Computer Communications
Test generation based on control and data dependencies within system specifications in SDL

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In feature testing of communication protocols, we want to construct a minimal number of tests with a desirable fault coverage. We model the protocols by extended finite state machines and reduce the test generation process to optimization problems on graphs. We study efficient algorithms and their complexity. We report experimental results on real systems, including Personal HandyPhone System, a 5ESS based ISDN wireless system, and 5ESS Intelligent Network Application Protocol.