Name
Abstract | ||
|---|---|---|
Our increasing dependence on complex and critical information infrastructures and the emerging threat of sophisticated attacks, ask for extended efforts to ensure the correctness and security of these systems. Byzantine fault-tolerant state-machine replication (BFT-SMR) provides a way to harden such systems. It ensures that they maintain correctness and availability in an application-agnostic way, provided that the replication protocol is correct and at least (n-f) out of n replicas survive arbitrary faults. This paper presents Velisarios, a logic-of-events based framework implemented in Coq, which we developed to implement and reason about BFT-SMR protocols. As a case study, we present the first machine-checked proof of a crucial safety property of an implementation of the area’s reference protocol: PBFT. |
Year | Venue | Field |
|---|---|---|
2018 | ESOP | State machine replication,Ask price,Programming language,Computer science,Correctness,Byzantine fault tolerance,Formal verification,Safety property,Distributed computing |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
51 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincent Rahli | 1 | 43 | 9.21 |
| Ivana Vukotic | 2 | 7 | 1.19 |
| Marcus Völp | 3 | 228 | 16.17 |
| Paulo Veríssimo | 4 | 2513 | 187.25 |