NDLI: Dynamic synthesis for relaxed memory models

Content Provider	ACM Digital Library
Author	Prisadnikov, Nedyalko Vechev, Martin Yahav, Eran Liu, Feng Nedev, Nayden
Abstract	Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, allowing control of this behavior. To implement a concurrent algorithm for a modern architecture, the programmer is forced to manually reason about subtle relaxed behaviors and figure out ways to control these behaviors by adding fences to the program. Not only is this process time consuming and error-prone, but it has to be repeated every time the implementation is ported to a different architecture. In this paper, we present the first scalable framework for handling real-world concurrent algorithms running on relaxed architectures. Given a concurrent C program, a safety specification, and a description of the memory model, our framework tests the program on the memory model to expose violations of the specification, and synthesizes a set of necessary ordering constraints that prevent these violations. The ordering constraints are then realized as additional fences in the program. We implemented our approach in a tool called DFence based on LLVM and used it to infer fences in a number of concurrent algorithms. Using DFence, we perform the first in-depth study of the interaction between fences in real-world concurrent C programs, correctness criteria such as sequential consistency and linearizability, and memory models such as TSO and PSO, yielding many interesting observations. We believe that this is the first tool that can handle programs at the scale and complexity of a lock-free memory allocator.
Starting Page	429
Ending Page	440
Page Count	12
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/2345156.2254115
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	47
Issue Number	6
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Synthesis Concurrency Relaxed memory models Testing Weak memory models
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Partial-coherence abstractions for relaxed memory models

A promising semantics for relaxed-memory concurrency

A Calculus for Relaxed Memory

Adversarial memory for detecting destructive races

Relaxed separation logic:a program logic for C11 concurrency

Herding cats:modelling, simulation, testing, and data-mining for weak memory

Relaxed-memory concurrency and verified compilation

Mathematizing C++ concurrency

Benchmarking weak memory models

Dynamic synthesis for relaxed memory models

Similar Documents

Partial-coherence abstractions for relaxed memory models

A promising semantics for relaxed-memory concurrency

A Calculus for Relaxed Memory

Adversarial memory for detecting destructive races

Relaxed separation logic:a program logic for C11 concurrency

Herding cats:modelling, simulation, testing, and data-mining for weak memory

Relaxed-memory concurrency and verified compilation

Mathematizing C++ concurrency

Benchmarking weak memory models

Dynamic synthesis for relaxed memory models