Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Shwuhwa S. Yu

dblp:00/875 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network management and operations · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network management and operations › network testing
protocol conformance testing
0.011992
A New Protocol Test Sequence Generation Method Based on UIOS · INFOCOM 1992
Network management and operations › network testing › protocol conformance testing
test sequence generation
0.011992
A New Protocol Test Sequence Generation Method Based on UIOS · INFOCOM 1992
Automata and formal languages
finite automata
0.011992
A New Protocol Test Sequence Generation Method Based on UIOS · INFOCOM 1992
Automata and formal languages › finite automata › sequential machines › state identification
unique input output sequences
0.011992
A New Protocol Test Sequence Generation Method Based on UIOS · INFOCOM 1992

Methods — techniques the papers use, named apart from their topics

characteristic set method · 0.0UIOv method · 0.0
YearPublicationVenuePosition
1992 A New Protocol Test Sequence Generation Method Based on UIOS
abstract
The authors propose a novel method for test sequence generation based on UIOS which only needs a minimal verification part. They also prove that the UIOv method (or revised unique input/output method) has the same applicability as the characteristic set method. The UIOv method can find a test sequence for any minimal finite-state machine. The proposed method has the same applicability as the UIOv method. In addition, the method uses a simple test on a given protocol specification to decide whether a verification part is needed for detecting transfer faults, the method can generate a minimal number of input/output sequences for a verification part. A more efficient algorithm for generating UIOSs and signature sets is presented. It is proven that the upper bound on the length of a UIOS is (n-1)*n rather than n/sup n/, where n is the number of states in a finite-state machine.>
Shwuhwa S. Yu, Ming T. Liu
INFOCOM1