9 citations · 25 across the 10 of their papers we have counts for
4 papers · 1 filter
A Pragmatic Approach to Stateful Partial Order Reduction
Berk Cirisci, Constantin Enea, Azadeh Farzan +1
Partial order reduction (POR) is a classic technique for dealing with the state explosion problem in model checking of concurrent programs. Theoretical optimality, i.e., avoiding e…
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers
Hagit Attiya, Constantin Enea, Jennifer Welch
A key way to construct complex distributed systems is through modular composition of linearizable concurrent objects. A prominent example is shared registers, which have crash-tole…
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…
Order out of Chaos: Proving Linearizability Using Local Views
Yotam M. Y. Feldman, Constantin Enea, Adam Morrison +2
Proving the linearizability of highly concurrent data structures, such as those using optimistic concurrency control, is a challenging task. The main difficulty is in reasoning abo…