Comments on “a reduced test suite for protocol conformance testing”

Authors:
Alexandre Petrenko
Affiliations:
Univ. of Montreal, Montreal, P. Q., Canada
Venue:
ACM Transactions on Software Engineering and Methodology (TOSEM)
Year:
1997

Citing 5
Cited 0

Protocol testing: review of methods and relevance for software testing

ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
A reduced test suite for protocol conformance testing

ACM Transactions on Software Engineering and Methodology (TOSEM)
Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-Method

IEEE Transactions on Software Engineering
Checking Experiments with Protocol Machines

Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
Conformance Relations and Test Derivation

Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI

Quantified Score

Hi-index	0.00

Visualization

Abstract

A previousACM TOSEM article of Ph. Bernhard (“A Reduced Test Suite of Protocol Conformance Testing,” ACM Transactions on Software Engineering and Methodology, Vol. 3, No. 3, July 1994, pages 201-220) describes three new versions of the so-called W-method for solving the protocol-testing problem, i.e., solving the Mealy machine equivalence problem. The author claims that these versions all have the same fault detection capability as the original W-method. In this correspondence we prove that the results of that article are incorrect.