9 citations · 26 across the 11 of their papers we have counts for
4 papers · 1 filter
Datalog-based Scalable Semantic Diffing of Concurrent Programs
Chungha Sung, Shuvendu Lahiri, Constantin Enea +1
When an evolving program is modified to address issues related to thread synchronization, there is a need to confirm the change is correct, i.e., it does not introduce unexpected b…
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…
On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony
Ahmed Bouajjani, Constantin Enea, Kailiang Ji +1
We address the problem of verifying message passing programs, defined as a set of parallel processes communicating through unbounded FIFO buffers. We introduce a bounded analysis t…
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…