ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1905.07805
  4. Cited By
Verification of Threshold-Based Distributed Algorithms by Decomposition
  to Decidable Logics

Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics

19 May 2019
Idan Berkovits
Marijana Lazić
Giuliano Losa
Oded Padon
Sharon Shoham
ArXivPDFHTML

Papers citing "Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics"

3 / 3 papers shown
Title
Revisiting Fast Practical Byzantine Fault Tolerance
Revisiting Fast Practical Byzantine Fault Tolerance
Ittai Abraham
Guy Golan Gueta
Dahlia Malkhi
Lorenzo Alvisi
R. Kotla
Jean-Philippe Martin
31
105
0
04 Dec 2017
Paxos Made EPR: Decidable Reasoning about Distributed Protocols
Paxos Made EPR: Decidable Reasoning about Distributed Protocols
Oded Padon
Giuliano Losa
Shmuel Sagiv
Sharon Shoham
27
111
0
19 Oct 2017
A Short Counterexample Property for Safety and Liveness Verification of
  Fault-tolerant Distributed Algorithms
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms
I. Konnov
Marijana Lazić
H. Veith
Josef Widder
18
76
0
18 Aug 2016
1