32 citations · 62 across the 9 of their papers we have counts for
9 papers
Holistic Verification of Blockchain Consensus
Nathalie Bertrand, Vincent Gramoli, Igor Konnov +3
Blockchain has recently attracted the attention of the industry due, in part, to its ability to automate asset transfers. It requires distributed participants to reach a consensus…
A case study on parametric verification of failure detectors
Thanh-Hai Tran, Igor Konnov, Josef Widder
Partial synchrony is a model of computation in many distributed algorithms and modern blockchains. These algorithms are typically parameterized in the number of participants, and t…
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
Igor Konnov, Marijana Lazić, Ilina Stoilkovska +1
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 c…
A Tendermint Light Client
Sean Braithwaite, Ethan Buchman, Ismail Khoffi +4
In Tendermint blockchains, the proof-of-stake mechanism and the underlying consensus algorithm entail a dynamic fault model that implies that the active validators (nodes that sign…
Reducing asynchrony to synchronized rounds
Andrei Damien, Cezara Dragoi, Alexandru Militaru +1
Synchronous computation models simplify the design and the verification of fault-tolerant distributed systems. For efficiency reasons such systems are designed and implemented usin…
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms
Igor Konnov, Marijana Lazic, Helmut Veith +1
Distributed algorithms have many mission-critical applications ranging from embedded systems and replicated databases to cloud computing. Due to asynchronous communication, process…