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

Qiang Gao 0004

dblp:43/5917-4 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · unresolved

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

Computer networks · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1

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
Distributed computing theory · 77% Automata and formal languages · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages
formal description techniques
0.011995
Validation of distributed algorithms and protocols · ICNP 1995

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

veda tool · 0.0simulation · 0.0estelle · 0.0
YearPublicationVenuePosition
1995 Validation of distributed algorithms and protocols
abstract
The use of formal description techniques allows the partial automation of the design, the validation, and the implementation of communication protocols and distributed algorithms. In this paper, we present a methodology for validation of distributed algorithms and protocols, and our experiences of using the Estelle language, and a simulation and validation tool, called Veda, to simulate and validate complex distributed algorithms for the distributed implementation of multi-rendezvous. Some design errors in published distributed rendezvous algorithms were found. We obtain from these experiences heuristic guidelines for trouble shooting of distributed algorithms.
Qiang Gao 0004, Roland Groz, Gregor von Bochmann, Joumana Dargham, E. Houssain Htite
ICNP1
1989 On the Distributed Implementation of LOTOS
Gregor von Bochmann, Qiang Gao 0004
FORTE2