7 citations · 12 across the 3 of their papers we have counts for
6 papers
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects
Hagit Attiya, Constantin Enea
It has been observed that linearizability, the prevalent consistency condition for implementing concurrent objects, does not preserve some probability distributions. A stronger con…
Checking Robustness Against Snapshot Isolation
Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea
Transactional access to databases is an important abstraction allowing programmers to consider blocks of actions (transactions) as executing in isolation. The strongest consistency…
Checking Linearizability of Concurrent Priority Queues
Ahmed Bouajjani, Constantin Enea, Chao Wang
Efficient implementations of concurrent objects such as atomic collections are essential to modern computing. Programming such objects is error prone: in minimizing the synchroniza…
Exposing Non-Atomic Methods of Concurrent Objects
Michael Emmi, Constantin Enea
Multithreaded software is typically built with specialized concurrent objects like atomic integers, queues, and maps. These objects' methods are designed to behave according to cer…
Proving linearizability using forward simulations
Ahmed Bouajjani, Michael Emmi, Constantin Enea +1
Linearizability is the standard correctness criterion concurrent data structures such as stacks and queues. It allows to establish observational refinement between a concurrent imp…
On Reducing Linearizability to State Reachability
Ahmed Bouajjani, Michael Emmi, Constantin Enea +1
Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortuna…