5 citations · 8 across the 3 of their papers we have counts for
5 papers
Tasks in Modular Proofs of Concurrent Algorithms
Armando Castañeda, Aurélie Hurault, Philippe Quéinnec +1
Proving correctness of distributed or concurrent algorithms is a mind-challenging and complex process. Slight errors in the reasoning are difficult to find, calling for computer-ch…
A Topological Perspective on Distributed Network Algorithms
Armando Castañeda, Pierre Fraigniaud, Ami Paz +3
More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems…
Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems
Achour Mostefaoui, Michel Raynal
The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of att…
Experimenting with Component-Based Middleware for Adaptive Fault Tolerant Computing
Miruna Stoicescu, Jean-Charles Fabre, Matthieu Roy
This short paper describes early experiments to validate the capabilities of a component-based platform to observe and control a software architecture in the small. This is part of…
A framework for proving the self-organization of dynamic systems
Emmanuelle Anceaume, Xavier Défago, Maria Potop-Butucaru +1
This paper aims at providing a rigorous definition of self- organization, one of the most desired properties for dynamic systems (e.g., peer-to-peer systems, sensor networks, coope…