<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Conference Paper</dc:product_type><dc:title>C11Tester: A race detector for C/C++ atomics</dc:title><dc:creator>Luo, Weiyu; Demsky, Brian</dc:creator><dc:corporate_author/><dc:editor>null</dc:editor><dc:description>Writing correct concurrent code that uses atomics under the C/C++ memory model is extremely difficult. We present C11Tester, a race detector for the C/C++ memory model that can explore executions in a larger fragment of the C/C++ memory model than previous race detector tools. Relative to previous work, C11Tester's larger fragment includes behaviors that are exhibited by ARM processors. C11Tester uses a new constraint-based algorithm to implement modification order that is optimized to allow C11Tester to make decisions in terms of application-visible behaviors. We evaluate C11Tester on several benchmark applications, and compare C11Tester's performance to both tsan11rec, the state of the art tool that controls scheduling for C/C++; and tsan11, the state of the art tool that does not control scheduling.</dc:description><dc:publisher/><dc:date>2021-04-17</dc:date><dc:nsf_par_id>10288002</dc:nsf_par_id><dc:journal_name>Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems</dc:journal_name><dc:journal_volume/><dc:journal_issue/><dc:page_range_or_elocation>630 to 646</dc:page_range_or_elocation><dc:issn/><dc:isbn/><dc:doi>https://doi.org/10.1145/3445814.3446711</dc:doi><dcq:identifierAwardId>2006948; 1703598; 1740210</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>