Verification of randomized consensus algorithms under round-rigid adversaries
Randomized fault-tolerant distributed algorithms pose a number of challenges for automated
verification:(i) parameterization in the number of processes and faults,(ii) randomized …
verification:(i) parameterization in the number of processes and faults,(ii) randomized …
Verifying Randomized Consensus Protocols with Common Coins
Randomized fault-tolerant consensus protocols with common coins are widely used in cloud
computing and blockchain platforms. Due to their fundamental role, it is vital to guarantee …
computing and blockchain platforms. Due to their fundamental role, it is vital to guarantee …
Survey on parameterized verification with threshold automata and the byzantine model checker
Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical
problems in distributed computing, such as reliable broadcast, two-phase commit, and …
problems in distributed computing, such as reliable broadcast, two-phase commit, and …
3.11 Parameterized Verification of Randomized Consensus Algorithms
M Lazic - Unifying Formal Methods for Trustworthy …, 2024 - dagstuhl.sunsite.rwth-aachen.de
In this talk I showed the extension of threshold automata for modeling randomized
consensus algorithms that perform an unbounded number of asynchronous rounds …
consensus algorithms that perform an unbounded number of asynchronous rounds …
[BOOK][B] Parameterized Verification of Synchronized Concurrent Programs
Z Ganjei - 2021 - books.google.com
There is currently an increasing demand for concurrent programs. Checking the correctness
of concurrent programs is a complex task due to the interleavings of processes. Sometimes …
of concurrent programs is a complex task due to the interleavings of processes. Sometimes …