EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Relaxed Memory Concurrency Re-executed

Evgenii Moiseenko, Matteo Meluzzi, Innokentii Meleshchenko, Ivan Kabashnyi, Anton Podkopaev, Soham Chakraborty

Proceedings of the ACM on Programming Languages · 07.01.2025 · 9 (POPL) · 2149-2175

DOI: 10.1145/3704908 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Programming Languages, online erschienen am 09.01.2025. Verfasst von Evgenii Moiseenko und 5 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 47 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Defining a formal model for concurrency in programming languages that addresses conflicting requirements from programmers, compilers, and architectures has been a long-standing research question. It is widely believed that traditional axiomatic per-execution models that reason about individual executions do not suffice to address these conflicting requirements. Consequently, several multi-execution models were proposed that reason about multiple executions together. Although multi-execution models were major breakthroughs in satisfying several desired properties, these models are complicated, challenging to adapt to existing language specifications given in per-execution style, and they are typically not friendly to automated reasoning tools. In response, we propose a re-execution-based memory model (XMM). Debunking the beliefs around per-execution and multi-execution models, XMM is (almost) a per-execution model. XMM reasons about individual executions, but unlike traditional per-execution models, it relates executions by a re-execution principle. As such, the memory consistency axioms and the out-of-order re-execution mechanics are orthogonal in XMM, allowing to use it as a semantic framework parameterized by a given axiomatic memory model. We instantiated the XMM framework for the RC20 language model, and proved that the resulting model XC20 provides DRF guarantees and allows standard hardware mappings and compiler optimizations. Note-worthy, XC20 is the first model of its kind that also supports thread sequentialization optimization. Moreover, XC20 is also amenable to automated reasoning. To demonstrate this, we developed a sound model checker XMC and evaluated it on several concurrency benchmarks.

Zitieren

APA

Moiseenko, E., Meluzzi, M., Meleshchenko, I., Kabashnyi, I., Podkopaev, A., & Chakraborty, S. (2025). Relaxed Memory Concurrency Re-executed. Proceedings of the ACM on Programming Languages, 9(POPL), 2149-2175. https://doi.org/10.1145/3704908

Vancouver

Moiseenko E, Meluzzi M, Meleshchenko I, Kabashnyi I, Podkopaev A, Chakraborty S. Relaxed Memory Concurrency Re-executed. Proceedings of the ACM on Programming Languages. 2025;9(POPL):2149-2175. doi:10.1145/3704908

BibTeX
@article{Moiseenko2025,
  author = {Moiseenko, Evgenii and Meluzzi, Matteo and Meleshchenko, Innokentii and Kabashnyi, Ivan and Podkopaev, Anton and Chakraborty, Soham},
  title = {Relaxed Memory Concurrency Re-executed},
  journal = {Proceedings of the ACM on Programming Languages},
  year = {2025},
  volume = {9},
  number = {POPL},
  pages = {2149--2175},
  doi = {10.1145/3704908}
}
Kostenlos starten →