32 citations · 38 across the 3 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
A dynamic epistemic logic analysis of the equality negation task
Eric Goubault, Marijana Lazic, Jeremy Ledent +1
In this paper we study the solvability of the equality negation task in a simple wait-free model where processes communicate by reading and writing shared variables or exchanging m…
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…