Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Software
Data sources: ZENODO
Zenodo
Claim

Artifact For PLDI 2026 Paper #304 SureDistrib: Verifying Almost-sure Termination of Composite Asynchronous Byzantine Protocols

integration_instructionsResearch softwarekeyboard_double_arrow_right Software Under curationPublisher:Zenodo
Authors: Qiu, Longfei; Xiao, Jingqi; Shin, Ji Yong; Shao, Zhong;

doi: 10.5281/zenodo.19616610

Artifact For PLDI 2026 Paper #304 SureDistrib: Verifying Almost-sure Termination of Composite Asynchronous Byzantine Protocols

Abstract

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 ofComposite Asynchronous Byzantine Protocols" (PLDI 2026). See README.md for full documentation.

Powered by OpenAIRE graph
Found an issue? Give us feedback