PSync: a partially synchronous language for fault-tolerant distributed algorithms

DOI10.1145/2837614.2837650zbMath1347.68036OpenAlexW2285931649MaRDI QIDQ2828285

Damien Zufferey, Cezara Dragoi, Thomas A. Henzinger

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2837614.2837650

zbMATH Keywords

consensusautomated verificationpartial synchronyfault-tolerant distributed algorithmsround model

Mathematics Subject Classification ID

Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker, Derivation of Heard-of Predicates from Elementary Behavioral Patterns, Cardinality constraints for arrays (decidability results and applications), \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms, Unnamed Item, A modular framework for verifying versatile distributed systems, Unnamed Item, Characterizing Consensus in the Heard-Of Model, Unnamed Item, Protocol combinators for modeling, testing, and execution of distributed systems

Uses Software

• Nuprl
• Erlang
• PSync
• Distal