Repucoin: Your reputation is your power
Existing proof-of-work cryptocurrencies cannot tolerate attackers controlling more than 50
percent of the network's computing power at any time, but assume that such a condition …
percent of the network's computing power at any time, but assume that such a condition …
Greybox fuzzing of distributed systems
Grey-box fuzzing is the lightweight approach of choice for finding bugs in sequential
programs. It provides a balance between efficiency and effectiveness by conducting a …
programs. It provides a balance between efficiency and effectiveness by conducting a …
Mostly automated proof repair for verified libraries
The cost of maintaining formally specified and verified software is widely considered
prohibitively high due to the need to constantly keep code and the proofs of its correctness in …
prohibitively high due to the need to constantly keep code and the proofs of its correctness in …
Igloo: soundly linking compositional refinement and separation logic for distributed system verification
Lighthouse projects like CompCert, seL4, IronFleet, and DeepSpec have demonstrated that
full system verification is feasible by establishing a refinement between an abstract system …
full system verification is feasible by establishing a refinement between an abstract system …
Security Analysis on dBFT protocol of NEO
NEO is ranked as one of the top blockchains by market capitalization. We provide a security
analysis on its backbone consensus protocol, called delegated Byzantine Fault Tolerance …
analysis on its backbone consensus protocol, called delegated Byzantine Fault Tolerance …
Lazarus: Automatic management of diversity in bft systems
A long-standing promise of Byzantine Fault-Tolerant (BFT) replication is to maintain the
service correctness despite the presence of malicious failures. The key challenge here is …
service correctness despite the presence of malicious failures. The key challenge here is …
Holistic verification of blockchain consensus
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 on a block …
automate asset transfers. It requires distributed participants to reach a consensus on a block …
Formalizing nakamoto-style proof of stake
Fault-tolerant distributed systems move the trust in a single party to a majority of parties
participating in the protocol. This makes blockchain based crypto-currencies possible: they …
participating in the protocol. This makes blockchain based crypto-currencies possible: they …
Verification of threshold-based distributed algorithms by decomposition to decidable logics
Verification of fault-tolerant distributed protocols is an immensely difficult task. Often, in these
protocols, thresholds on set cardinalities are used both in the process code and in its …
protocols, thresholds on set cardinalities are used both in the process code and in its …
Counterexample driven quantifier instantiations with applications to distributed protocols
Formally verifying infinite-state systems can be a daunting task, especially when it comes to
reasoning about quantifiers. In particular, quantifier alternations in conjunction with function …
reasoning about quantifiers. In particular, quantifier alternations in conjunction with function …