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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ming Yu Yao

dblp:14/6711 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1996
—ORCID · none

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

Computer networks · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 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.

Theoretical computer science
1 paper
Automata and formal languages · 100%
Software engineering, system software, and programming languages
1 paper
Software testing · 100%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages
finite automata
0.011994
Fault Coverage Analysis in Respect to an FSM Specification · INFOCOM 1994
Automata and formal languages › automata algorithms
state minimization
0.011994
Fault Coverage Analysis in Respect to an FSM Specification · INFOCOM 1994

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

test tree minimization · 0.0
YearPublicationVenuePosition
1996 On Fault Coverage of Tests for Finite State Specifications
Alexandre Petrenko, Gregor von Bochmann, Ming Yu Yao
Comput. Networks ISDN Syst.3
1994 A structural analysis approach to the evaluation of fault coverage for protocol conformance testing
Ming Yu Yao, Alexandre Petrenko, Gregor von Bochmann
FORTE1
1994 Fault Coverage Analysis in Respect to an FSM Specification
abstract
It is shown in this paper that the problem of deciding if a test suite generated from a finite state machine provides complete fault coverage can be converted into the problem of minimizing the test tree representing the test suite. A fault coverage analysis procedure, capable of deciding if a given test suite provides complete fault coverage in respect to a given FSM specification, is then developed. The core of this procedure is a state minimization procedure developed specifically for the class of FSMs whose graphic representations are trees. The fault coverage analysis procedure can cope with partially specified FSM specifications which need not be reduced and faults that increase the number of states up to a chosen upper bound. Two necessary and one sufficient conditions, which in some cases may simplify the fault coverage analysis, are also presented.>
Ming Yu Yao, Alexandre Petrenko, Gregor von Bochmann
INFOCOM1