Affiliation:
1. University of Toronto, Toronto, Canada
2. National University of Singapore, Singapore, Singapore
Abstract
Trace theory
(formulated by Mazurkiewicz in 1987) is a principled framework for defining equivalence relations for concurrent program runs based on a commutativity relation over the set of atomic steps taken by individual program threads. Its simplicity, elegance, and algorithmic efficiency makes it useful in many different contexts including program verification and testing. It is well-understood that the larger the equivalence classes are, the more benefits they would bring to the algorithms and applications that use them. In this paper, we study relaxations of trace equivalence with the goal of maintaining its algorithmic advantages.
We first prove that the largest appropriate relaxation of trace equivalence, an equivalence relation that preserves the order of steps taken by each thread
and
what write operation each read operation observes, does not yield efficient algorithms. Specifically, we prove a
linear space lower bound
for the problem of checking, in a streaming setting, if two arbitrary steps of a concurrent program run are
causally concurrent
(i.e. they can be reordered in an equivalent run) or
causally ordered
(i.e. they always appear in the same order in all equivalent runs). The same problem can be decided in
constant space
for trace equivalence. Next, we propose a new commutativity-based notion of equivalence called
grain equivalence
that is strictly more relaxed than trace equivalence, and yet yields a constant space algorithm for the same problem. This notion of equivalence uses commutativity of
grains
, which are sequences of atomic steps, in addition to the standard commutativity from trace theory. We study the two distinct cases when the grains are contiguous subwords of the input program run and when they are not, formulate the precise definition of causal concurrency in each case, and show that they can be decided in
constant space
, despite being strict relaxations of the notion of causal concurrency based on trace equivalence.
Publisher
Association for Computing Machinery (ACM)
Reference63 articles.
1. Optimal stateless model checking for reads-from equivalence under sequential consistency
2. Stateless Model Checking Under a Reads-Value-From Equivalence
3. Predictive Monitoring against Pattern Regular Languages
4. Serge Bauget and Paul Gastin. 1995. On congruences and partial orders. In Mathematical Foundations of Computer Science 1995, Jiří Wiedermann and Petr Hájek (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 434–443. isbn:978-3-540-44768-9
5. Data-centric dynamic partial order reduction
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Optimistic Prediction of Synchronization-Reversal Data Races;Proceedings of the IEEE/ACM 46th International Conference on Software Engineering;2024-04-12
2. Predictive Monitoring with Strong Trace Prefixes;Lecture Notes in Computer Science;2024