Checking Concurrent Data Structures Under the C/C++11 Memory Model

OuPeizhao,; DemskyBrian,

doi:10.1145/3155284.3018749

Cited by 11 publications

(14 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As can be seen in Table 2.1, despite the wide literature on data race detection techniques, we only find the work by Ou et al [106] to be able to directly handle the semantics of lock-free data structures within the CDSchecker with special annotations.…”

Section: Concurrent Software Verificationmentioning

confidence: 99%

Exploring stream parallel patterns in distributed MPI environments

et al. 2019

View full text Add to dashboard Cite

En primer lugar, a mis padres. Os debo todo lo que soy y seré. Gracias por el cuidado y educación recibidos, por los buenos (y malos) momentos, por aquellos días de piscina en Playa de Madrid, por las barbacoas en la Fundación del Lesionado Medular/ASPAYM Madrid, por las comidas en "La Bodeguita" y en el Centro Municipal de Mayores Ascao. Gracias a vosotros aprendí a ser fuerte. A mamá, porque me enseñaste lo más importante, a sonreir a pesar de la adversidad, y otras cosas de menor importancia, como mantener un hogar. A papá, por enseñarme gran parte de lo que sé, el equilibrio, e iluminarme el camino; aunque fuera de forma accidental, sin tí, mi vocación sería otra. Nunca os lo podré agradecer tanto como lo merecisteis. D.E.P.En segundo lugar, a mis compañeros de trabajo: Manu, Javi Doc, y David. Por todos los momentos compartidos en el laboratorio y fuera de él; por ayudarme y presionarme para que trabajara. Sin vosotros, dudo que estuviera escribiendo estas líneas ahora. A mis compañeros de laboratorio: Guille, Mario, Javi Prieto, y José Cabrero, por las charlas y momentos de risa. A Alejandro Calderón, que siempre ha estado ahí para escucharme y echar una mano. A José Daniel, por darme la oportunadad de trabajar en el grupo y por estar ahí en los momentos difíciles que últimamente han acontecido. También a mis compañeros de trabajo del CERN: Enric, Stephan, Guilherme, Bertrand, Javi, Emmanouil "Manos", y especialmente a Axel, Jakob y Pere, por acogerme en ROOT.No voy a terminar sin mencionar a las personas que siempre estuvieron ahí (no, no me olvido de vosotros): a mi hermano, a Úrsula, a mi tía Paloma y mi tío Matías, a mi primo "el niño".

show abstract

Section: Concurrent Software Verificationmentioning

confidence: 99%

Exploring stream parallel patterns in distributed MPI environments

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Their work is helpful to concurrency error detection. Peizhao et al [37] propose a correctness model to check concurrent data structures. Their method can detect the concurrency bugs in concurrent data structures.…”

Section: Related Workmentioning

confidence: 99%

PVcon: Localizing Hidden Concurrency Errors With Prediction and Verification

Shen

Luo

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Multi-core techniques have been widely used in various hardware platforms, promoting development of concurrent programs. Unfortunately, concurrent programs are prone to concurrency errors. At present, it is still an open issue to provide high coverage detection of concurrency errors. In this paper, we present an enhanced dynamic concurrency error detection technique, called P V con, which can detect more concurrency errors than existing techniques. PVcon first finds suspicious locations of concurrency errors by applying a novel relation, elastic-causalities (EC), and then strictly verifies each suspicious concurrency errors with a lightweight intentional scheduling technique. We have implemented PVcon in C/C++ and evaluated it by localizing concurrency errors from real-world programs. The experimental results show that PVcon can efficiently detect twice more concurrency errors than other techniques.

show abstract

“…Despite the wide literature on data race detection techniques, we only find the work by Ou et al [21] to be able to directly handle the semantics of lock-free data structures within the CDSchecker with special annotations. In this work, we present a similar approach to detect semantic violations for this kind of data structures which makes use of the upcoming C++20 contracts programming features to express semantic constraints.…”

Section: Related Workmentioning

confidence: 99%

Detecting semantic violations of lock-free data structures through C++ contracts

et al. 2019

View full text Add to dashboard Cite

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. Thanks to this framework, we are able to check the correct use of lock-free data structures, thus reducing the number of false positives.

show abstract

Checking Concurrent Data Structures Under the C/C++11 Memory Model

Cited by 11 publications

References 39 publications

Exploring stream parallel patterns in distributed MPI environments

Exploring stream parallel patterns in distributed MPI environments

PVcon: Localizing Hidden Concurrency Errors With Prediction and Verification

Detecting semantic violations of lock-free data structures through C++ contracts

Contact Info

Product

Resources

About