Affiliation:
1. MPI-SWS, Germany
2. Tel Aviv University, Israel
Abstract
The metatheory of axiomatic weak memory models covers questions like the
correctness of compilation mappings from one model to another and the
correctness of local program transformations according to a given model---topics
usually requiring lengthy human investigation.
We show that these questions can be solved by answering a
more basic question: "Given two memory models, is one weaker than the other?"
Moreover, for a wide class of axiomatic memory models, we show that this
basic question can be reduced to a language inclusion problem between regular
languages, which is decidable.
Similarly, implementing an efficient check for whether an execution graph is
consistent according to a given memory model has required non-trivial manual
effort. Again, we show that such efficient checks can be derived automatically
for a wide class of axiomatic memory models, and that incremental consistency checks
can be incorporated in GenMC, a state-of-the-art model checker for concurrent
programs. As a result, we get the first time- and space-efficient bounded
verifier taking the axiomatic memory model as an input parameter.
Funder
European Research Council
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. How Hard Is Weak-Memory Testing?;Proceedings of the ACM on Programming Languages;2024-01-05
2. Static Analysis of Memory Models for SMT Encodings;Proceedings of the ACM on Programming Languages;2023-10-16
3. Optimal Reads-From Consistency Checking for C11-Style Memory Models;Proceedings of the ACM on Programming Languages;2023-06-06