Published March 14, 2026
| Version v1
Software
Open
Artifact For PLDI 2026 Paper #304 SureDistrib: Verifying Almost-sure Termination of Composite Asynchronous Byzantine Protocols
Authors/Creators
-
1.
Yale University
- 2. Shanghai Jiao Tong University
-
3.
University of Hong Kong
-
4.
Northeastern University
Description
This artifact contains mechanized safety and liveness proofs for an asynchronous byzantine binary agreement algorithm,
which is a modified version of the binary agreement algorithm described by Mostefaoui et al. (PODC '14).
The mechanization is based on the formal theory described in the paper "SureDistrib: Verifying Almost-sure Termination of
Composite Asynchronous Byzantine Protocols" (PLDI 2026).
See README.md for full documentation.
Files
Files
(151.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:27361833f3f687364761e2334a473f68
|
151.7 kB | Download |