Dynamic data race prediction: fundamentals, theory, and practice (tutorial)

Abstract

Data races are the most common concurrency bugs and considerable efforts are put in ensuring data-race-free (DRF) programs. The most popular approach is via dynamic analyses, which soundly report DRF violations by analyzing program executions. Recently, there has been a prevalent shift to predictive analysis techniques. Such techniques attempt to predict DRF violations even in unobserved program executions, while making sure that the analysis is sound (does not raise false positives).

BibTeX

@inproceedings{Mathur-Pavlogiannis:FSE22,
  author    = {Umang Mathur and
               Andreas Pavlogiannis},
  title     = {Dynamic data race prediction: fundamentals, theory, and practice (tutorial)},
  booktitle = {{ESEC/SIGSOFT} {FSE}},
  pages     = {1820},
  publisher = {{ACM}},
  year      = {2022},
}

Dynamic data race prediction: fundamentals, theory, and practice (tutorial)

Abstract

Related papers