Approaches to Obtaining Shared Memory Dependences for Dynamic Analysis of Concurrent Programs: A SurveyChinese Full TextEnglish Full Text (MT)
JIANG Yan-Yan;XU Chang;MA Xiao-Xing;Lü Jian;State Key Laboratory for Novel Software Technology (Nanjing University);Department of Computer Science and Technology, Nanjing University;
Abstract: Concurrent bugs are difficult to trigger, debug, and detect. Dynamic program analysis techniques have been proven useful in addressing such challenges. Due to non-deterministic nature of concurrent programs in which the major source of non-determinism is the shared memory, obtaining the order of shared memory accesses, i.e., shared memory dependences, is the basis of such dynamic analyses. This work proposes a survey framework to demonstrate the key issues in obtaining the shared memory dependences. The framework includes four performance metrics（immediacy, accuracy, efficiency and simplicity）, two categories of approaches（online tracing and offline synthesis）, and two categories of applications（trace analysis and concurrency control）. Existing techniques as well as potential future work are studied in the paper.
- DOI：
10.13328/j.cnki.jos.005193
- Series：
- Subject：
- Classification Code：
TP311.1
- Mobile Reading
Read on your phone instantly
Step 1Scan QR Codes
"Mobile CNKI-CNKI Express" App
Step 2Open“CNKI Express”
and click the scan icon in the upper left corner of the homepage.
Step 3
Scan QR Codes
Read this article on your phone.
- Download
- Online Reading
Download the mobile appuse the app to scan this coderead the article.
Tips: Please download CAJViewer to view CAJ format full text.
Download: 400 Page: 747-763 Pagecount: 17 Size: 930K
Citation Network
Related Literature
- Similar Article
- Reader Recommendation
- Associated Author