Nuda Zhang

dblp:266/7674 · also Tony Nuda Zhang · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2025
0009-0009-0288-8270ORCID · reported

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

Software engineering, systems software and programming languages · 3 · 3 first-author · 3 since 2021Systems, architecture and hardware · 1Security and privacy · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Pilotfish: Distributed Execution for Scalable Blockchains
Quentin Kniep, Eleftherios Kokoris-Kogias, Alberto Sonnino, Igor Zablotchi, Nuda Zhang
FC5
2025 Basilisk: Using Provenance Invariants to Automate Proofs of Undecidable Protocols
Nuda Zhang, Tej Chajed, Manos Kapritsos, Bryan Parno
OSDI1
2024 Inductive Invariants That Spark Joy: Using Invariant Taxonomies to Streamline Distributed Protocol Proofs
Nuda Zhang, Travis Hance, Manos Kapritsos, Tej Chajed, Bryan Parno
OSDI1
2023 Performal: Formal Verification of Latency Properties for Distributed Systems
abstract
Understanding and debugging the performance of distributed systems is a notoriously hard task, but a critical one. Traditional techniques like logging, tracing, and benchmarking represent a best-effort way to find performance bugs, but they either require a full deployment to be effective or can only find bugs after they manifest. Even with such techniques in place, real deployments often exhibit performance bugs that cause unwanted behavior. In this paper, we present Performal, a novel methodology that leverages the recent advances in formal verification to provide rigorous latency guarantees for real, complex distributed systems. The task is not an easy one: it requires carefully decoupling the formal proofs from the execution environment, formally defining latency properties, and proving them on real, distributed implementations. We used Performal to prove rigorous upper bounds for the latency of three applications: a distributed lock, ZooKeeper and a MultiPaxos-based State Machine Replication system. Our experimental evaluation shows that these bounds are a good proxy for the behavior of the deployed system and can be used to identify performance bugs in real-world systems.
Nuda Zhang, Upamanyu Sharma, Manos Kapritsos
Proc. ACM Program. Lang.1
2020 Brief Announcement: On the Significance of Consecutive Ballots in Paxos
abstract
In this paper, we examine the Paxos protocol and demonstrate how the discrete numbering of ballots can be leveraged to weaken the conditions for learning. Specifically, we define the notion of consecutive ballots and use this to define Consecutive Quorums. Consecutive Quorums weaken the learning criterion such that a learner does not need matching accept messages sent in the same ballot from a majority of acceptors to learn a value. We prove that this modification preserves the original safety and liveness guarantees of Paxos. We define Consecutive Paxos which encapsulates the properties of discrete consecutive ballots. To establish the correctness of these results, in addition to a paper proof, we formally verify the correctness of a State Machine Replication Library built on top of an optimized version of Multi-Paxos modified to reflect Consecutive Paxos.
Eli Goldweber, Nuda Zhang, Manos Kapritsos
PODC2