9 citations · 25 across the 10 of their papers we have counts for
4 papers · 1 filter
Verifying Visibility-Based Weak Consistency
Siddharth Krishna, Michael Emmi, Constantin Enea +1
Multithreaded programs generally leverage efficient and thread-safe concurrent objects like sets, key-value maps, and queues. While some concurrent-object operations are designed t…
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…
Reasoning About TSO Programs Using Reduction and Abstraction
Ahmed Bouajjani, Constantin Enea, Suha Orhun Mutluergil +1
We present a method for proving that a program running under the Total Store Ordering (TSO) memory model is robust, i.e., all its TSO computations are equivalent to computations un…
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…