29 citations · 109 across the 33 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.PL2026★ 1 cited
On the Complexity of Checking Soundness of Natural Reductions (Extended Version)
Constantin Enea, Azadeh Farzan, Dominik Klumpp
The verification of reductions, representative subsets of interleavings, simplifies correctness proofs of parameterized concurrent programs. We introduce an expressive class of syn…
cs.PL2026
Reduction for Structured Concurrent Programs
Namratha Gangamreddypalli, Constantin Enea, Shaz Qadeer
Commutativity reasoning based on Lipton's movers is a powerful technique for verification of concurrent programs. The idea is to define a program transformation that preserves a su…