9 citations · 26 across the 11 of their papers we have counts for
5 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…
On the Complexity of Checking Transactional Consistency
Ranadeep Biswas, Constantin Enea
Transactions simplify concurrent programming by enabling computations on shared data that are isolated from other concurrent computations and are resilient to failures. Modern data…
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…
Replication-Aware Linearizability
Constantin Enea, Suha Orhun Mutluergil, Gustavo Petri +1
Geo-distributed systems often replicate data at multiple locations to achieve availability and performance despite network partitions. These systems must accept updates at any repl…