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
Demo Data from VLDB 2026 / reviewers in the wild / expert

Zhongping Tao

dblp:03/2492 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none

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

Computer networks · 2 · 2 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
Internet architecture and protocols · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
protocol engineering		 0.011995
Verification and diagnosis of testing equivalence and reduction relation · ICNP 1995

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

algorithms · 0.0algorithm · 0.0
YearPublicationVenuePosition
1997 A Formal Method for Synthesizing Optimized Protocol Converters and Its Application to Mobile Data Networks
Zhongping Tao, Gregor von Bochmann, Rachida Dssouli
 Mob. Networks Appl.1
1995 Verification and diagnosis of testing equivalence and reduction relation
abstract
In protocol engineering, a common approach for system design and implementation is to verify if an implementation specification (or any lower level specification) satisfies its service specification. If an implementation specification does not satisfy its service specification, it is necessary to find out the faults and correct them. In this paper, we present an efficient algorithm for verifying whether an implementation satisfies its service specification related by the testing equivalence and the reduction relation, and generating diagnostic information if an implementation does not satisfy its service specification, based on the transformation of the service specification into a special deterministic machine, called refusal graph, and the coupled product of the refusal graph and the implementation.
Zhongping Tao, Gregor von Bochmann, Rachida Dssouli
 ICNP1