RT Journal Article
T1 Detecting semantic violations of lock-free data structures through C++ contracts
A1 López Gómez, Javier
A1 Río Astorga, David del
A1 Dolz Zaragoza, Manuel Francisco
A1 Fernández Muñoz, Javier
A1 Garcia Sanchez, Jose Daniel
AB The use of synchronization mechanisms in multithreaded applications is essential on shared-memory multi-core architectures. However, debugging parallel applications to avoid potential failures, such as data races or deadlocks, can be challenging. Race detectors are key to spot such concurrency bugs; nevertheless, if lock-free data structures are used, these may emit a significant number of false positives. In this paper, we present a framework for semantic violation detection of lock-free data structures which makes use of contracts, a novel feature of the upcoming C++20, and a customized version of the ThreadSanitizer race detector. We evaluate the detection accuracy of the framework in terms of false positives and false negatives leveraging some synthetic benchmarks which make use of the SPSC and MPMC lock-free queue structures from the Boost C++ library. Thanks to this framework, we are able to check the correct use of lock-free data structures, thus reducing the number of false positives.
PB Springer Nature
SN 0920-8542
SN 1573-0484 (online)
YR 2019
FD 2019-03-26
LK https://hdl.handle.net/10016/29700
UL https://hdl.handle.net/10016/29700
LA eng
NO ASPIDE: Exascale programIng models for extreme data processing
NO This work has been partially funded by the Spanish Ministry of Economy and Competitiveness through Project Grant TIN2016-79637-P (BigHPC - Towards Unification of HPC and Big Data Paradigms) and the European Commission through Grant No. 801091 (ASPIDE - Exascale programmIng models for extreme data processing).
DS e-Archivo
RD 30 jun. 2024