2 citations · 5 across the 13 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2019★ 1 cited
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics
Idan Berkovits, Marijana Lazic, Giuliano Losa +2
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 an…
cs.PL2017
Paxos Made EPR: Decidable Reasoning about Distributed Protocols
Oded Padon, Giuliano Losa, Mooly Sagiv +1
Distributed protocols such as Paxos play an important role in many computer systems. Therefore, a bug in a distributed protocol may have tremendous effects. Accordingly, a lot of e…