Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2023
Tasks in modular proofs of concurrent algorithms
AbstractProving the correctness of distributed or concurrent algorithms is a complex process. Errors in the reasoning are hard to find, calling for computer-checked proof systems like Coq or TLA+. To use these tools, sequential specifications of base ...
- articleDecember 2011
The minimum information about failures for solving non-local tasks in message-passing systems
Distributed Computing (DICO), Volume 24, Issue 5Pages 255–269https://doi.org/10.1007/s00446-011-0146-4We first define the basic notions of local and non-local tasks for distributed systems. Intuitively, a task is local if, in a system with no failures, each process can compute its output value locally by applying some local function on its own input ...