5 papers
On the Limits of Causal Observation in Shared-Memory Systems
Gilde Valeria RodrÃguez, Armando Castañeda, Miguel Piña
Determining whether one concurrent operation completed before another began is a fundamental prerequisite for reasoning about the correctness of concurrent systems. We formalize th…
Lattice Aggregation in Distributed Verification under Crash and Byzantine Failures
Gilde Valeria RodrÃguez, Borzoo Bonakdarpour, Armando Castañeda +1
We introduce c-Lattice Aggregation, a fault-tolerant reconstruction problem for distributed verification under crash and Byzantine failures. In our setting, n asynchronous processe…
Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing
Hagit Attiya, Armando Castañeda, Constantin Enea
This paper studies the relation between agreement and strongly linearizable implementations of various objects. This leads to new results about implementations of concurrent object…
Equivalence and Separation between Heard-Of and Asynchronous Message-Passing Models
Hagit Attiya, Armando Castañeda, Dhrubajyoti Ghosh +1
We revisit the relationship between two fundamental models of distributed computation: the asynchronous message-passing model with up to crash failures ()…
Read-Modify-Writable Snapshots from Read/Write operations
Armando Castañeda, Braulio Ramses Hernández MartÃnez
In the context of asynchronous concurrent shared-memory systems, a snapshot algorithm allows failure-prone processes to concurrently and atomically write on the entries of a shared…