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

Gerald Huang

dblp:407/4276 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0009-1014-2567ORCID · reported

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

Systems, architecture and hardware · 1 · 1 since 2021

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
Automated reasoning and model checking · 87% Logic in computer science · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › consensus
byzantine agreement
0.912025
Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols · PODC 2025
Distributed systems
fault tolerance
0.912025
Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols · PODC 2025
Automated reasoning and model checking › model checking
epistemic model checking
0.912025
Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols · PODC 2025
Automated reasoning and model checking › synthesis
protocol synthesis
0.912025
Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols · PODC 2025

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

synthesis · 1.7model checking · 1.7epistemic logic · 1.7
YearPublicationVenuePosition
2025 Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols
abstract
Logics of knowledge and knowledge-based programs provide a way to give abstract descriptions of solutions to problems in fault-tolerant distributed computing, and have been used to derive optimal protocols for these problems with respect to a variety of failure models. Generally, these results have involved complex pencil and paper analyses with respect to the theoretical "full-information protocol" model of information exchange between network nodes. It is equally of interest to be able to establish the optimality of protocols using weaker, but more practical, models of information exchange, or else identify opportunities to improve their performance. Over the last 20 years, automated verification and synthesis tools for the logic of knowledge have been developed, such as the model checker MCK, that can be applied to this problem. This paper concerns the application of MCK to automated analyses of this kind. A number of information-exchange models are considered, for Simultaneous and Eventual variants of Byzantine Agreement under a range of failure types. MCK is used to automatically analyze these models. The results demonstrate that it is possible to automatically identify optimization opportunities, and to automatically synthesize optimal protocols. The paper provides performance measurements for the automated analysis, establishing a benchmark for epistemic model checking and synthesis tools.
Kaya Alpturer, Gerald Huang, Ron van der Meyden
PODC2