Coarser Equivalences for Causal Concurrency

Explore a 20-minute conference talk from POPL 2024 that delves into coarser equivalences for causal concurrency. Examine the relaxations of trace equivalence in concurrent program runs, focusing on maintaining algorithmic advantages. Learn about the limitations of the largest appropriate relaxation and discover a new commutativity-based notion called grain equivalence. Understand how grain equivalence offers a more relaxed alternative to trace equivalence while still allowing for efficient algorithms. Investigate the concept of causal concurrency in different contexts and its implications for program verification and testing. Gain insights into the constant space algorithms for deciding causal concurrency based on grain equivalence, both for contiguous and non-contiguous grains.

[POPL'24] Coarser Equivalences for Causal Concurrency