8 citations · 10 across the 4 of their papers we have counts for
11 papers
Modular Baskets Queue
Armando Castañeda, Miguel Piña
A modular version of the baskets queue of Hoffman, Shalev and Shavit is presented. It manipulates the head and tail using a novel object called load-link/increment-conditional, whi…
Communication Pattern Models: An Extension of Action Models for Dynamic-Network Distributed Systems
Diego A. Velázquez, Armando Castañeda, David A. Rosenblueth
Halpern and Moses were the first to recognize, in 1984, the importance of a formal treatment of knowledge in distributed computing. Many works in distributed computing, however, st…
Locally Solvable Tasks and the Limitations of Valency Arguments
Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
An elegant strategy for proving impossibility results in distributed computing was introduced in the celebrated FLP consensus impossibility proof. This strategy is local in nature…
Fully Read/Write Fence-Free Work-Stealing with Multiplicity
Armando Castañeda, Miguel Piña
Work-stealing is a popular technique to implement dynamic load balancing in a distributed manner. In this approach, each process owns a set of tasks that have to be executed. The o…
Relaxed Queues and Stacks from Read/Write Operations
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
Considering asynchronous shared memory systems in which any number of processes may crash, this work identifies and formally defines relaxations of queues and stacks that can be no…
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…