EUVIMEDEUVIMED entdecken
Crossref

Sound Static Data Race Verification for C: Is the Race Lost?

Karoliine Holter, Simmo Saan, Patrick Lam, Vesal Vojdani

ACM Transactions on Programming Languages and Systems · 30.09.2025 · 47 (3) · 1-40

DOI: 10.1145/3732933 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Programming Languages and Systems, online erschienen am 15.09.2025. Verfasst von Karoliine Holter und 3 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 93 Literaturangaben. Gefördert von: European Union and the Sponsor Estonian Research Council.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Sound static data race freedom verification has been a long-standing challenge in the field of programming languages. While actively researched a decade ago, most practical data race detection tools have since abandoned soundness. Is sound static race freedom verification for real-world C programs a lost cause? In this work, we investigate the obstacles to making significant progress in automated race freedom verification. We selected a benchmark suite of real-world programs and, as our primary contribution, extracted a set of coding idioms that represent fundamental barriers to verification. We expressed these idioms as micro-benchmarks and contributed them as evaluation tasks for the International Competition on Software Verification, SV-COMP. To understand the current state, we measure how sound automated verification tools competing in SV-COMP perform on these idioms and also when used out of the box on the real-world programs. For 8 of the 20 coding idioms, there does exist an automated race freedom verifier that can verify it; however, we also found significant unsoundness in leading verifiers, including Goblint and Deagle. Five of the seven tools failed to return any result on any real-world benchmarks under our chosen resource limitations, with the remaining two tools verifying race freedom for 2 of the 18 programs and crashing or returning inconclusive results on the others. We thus show that state-of-the-art verifiers have both superficial and fundamental barriers to correctly analyzing real-world programs. These barriers constitute the open problems that must be solved to make progress on automated static data race freedom verification.

Förderung

  • European Union and the Sponsor Estonian Research Council

Zitieren

APA

Holter, K., Saan, S., Lam, P., & Vojdani, V. (2025). Sound Static Data Race Verification for C: Is the Race Lost?. ACM Transactions on Programming Languages and Systems, 47(3), 1-40. https://doi.org/10.1145/3732933

Vancouver

Holter K, Saan S, Lam P, Vojdani V. Sound Static Data Race Verification for C: Is the Race Lost?. ACM Transactions on Programming Languages and Systems. 2025;47(3):1-40. doi:10.1145/3732933

BibTeX
@article{Holter2025,
  author = {Holter, Karoliine and Saan, Simmo and Lam, Patrick and Vojdani, Vesal},
  title = {Sound Static Data Race Verification for C: Is the Race Lost?},
  journal = {ACM Transactions on Programming Languages and Systems},
  year = {2025},
  volume = {47},
  number = {3},
  pages = {1--40},
  doi = {10.1145/3732933}
}
Kostenlos starten →