微信服务号

微信订阅号

2025年4月14日 5:58 星期一
首页 > 过刊浏览>2017年第28卷第4期 >747-763. DOI:10.13328/j.cnki.jos.005193
PDF HTML阅读 XML下载 导出引用 引用提醒
获取访存依赖:并发程序动态分析基础技术综述
作者:
基金项目:

国家重点基础研究发展计划（973）（2015CB352202）；国家自然科学基金（61472177，61690204）；江苏省软件新技术与产业化协同创新中心资助


Approaches to Obtaining Shared Memory Dependences for Dynamic Analysis of Concurrent Programs: A Survey
Author:
Fund Project:

National Basic Research Program of China (973) (2015CB352202); National Natural Science Foundation of China (61472177, 61690204); the Collaborative Innovation Center for Novel Software Tehcnology and Industralization

  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [101]
    • |
  • 相似文献 [20]
    • |
  • 引证文献
    • | |
  • 文章评论
    摘要:

    并发错误难触发、难调试、难检测.为应对这一挑战，已有动态程序分析技术通过观测或控制并发程序执行实现其质量保障.由于并发程序不确定性主要来自共享内存，实现其动态分析的基本问题即是获取线程访问共享内存的顺序，即获取访存依赖.提出访存依赖获取技术的综述框架，包含4个评价指标（即时性、准确性、高效性、简化性）、两种方法（在线追踪、离线合成）、两类应用（轨迹分析、并发控制）.通过对已有技术的总结和分析框架中的空白，对未来可能的研究方向予以展望.

    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.

    参考文献
    [1] Hofstee HP. Future microprocessors and off-chip SOP interconnect. IEEE Trans. on Advanced Packaging, 2004,27(2):301-303.[doi:10.1109/TADVP.2004.830355]
    [2] Lu S, Park S, Seo E, Zhou Y. Learning from mistakes:A comprehensive study on real world concurrency bug characteristics. In:Eggers SJ, Larus JR, eds. Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). ACM, 2008. 329-339.
    [3] Goodstein ML, Vlachos E, Chen S, Gibbons PB, Kozuch MA, Mowry TC. Butterfly analysis:Adapting dataflow analysis to dynamic parallel monitoring. In:Proc. of the Int'l Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2010. 257-270.[doi:10.1145/1736020.1736050]
    [4] Lu S, Tucek J, Qin F, Zhou Y. AVIO:Detecting atomicity violations via access interleaving invariants. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2006. 37-48.[doi:10.1145/1168857. 1168864]
    [5] Sen K. Race directed random testing of concurrent programs. In:Proc. of the Conf. on Programming Language Design and Implementation (PLDI). 2008. 11-21.[doi:10.1145/1375581.1375584]
    [6] Leblanc TJ, Mellor-Crummey JM. Debugging parallel programs with instant replay. IEEE Trans. on Computers, 1987,C-36(4):471-482.[doi:10.1109/TC.1987.1676929]
    [7] Herlihy M, Moss JE. Transactional memory:Architectural support for lock-free data structures. In:Proc. of the Int'l Symp. on Computer Architecture (ISCA). 1993. 289-300.[doi:10.1145/165123.165164]
    [8] Shavit N, Touitou D. Software transactional memory. In:Anderson JH, ed. Proc. of the Symp. on Principles of Distributed Computing (PODC). ACM, 1995. 204-213.
    [9] Dice D, Shavit N. Understanding tradeoffs in software transactional memory. In:Proc. of the Int'l Symp. on Code Generation and Optimization (CGO). 2007. 21-33.[doi:10.1109/CGO.2007.38]
    [10] Devietti J, Nelson J, Bergan T, Ceze L, Grossman D. RCDC:A relaxed consistency deterministic computer. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2012. 67-78.[doi:10.1145/1950365. 1950376]
    [11] Sengupta A, Biswas S, Zhang M, Bond MD, Kulkarni M. Hybrid static-dynamic analysis for statically bounded region serializability. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2015. 561-575.[doi:10.1145/2694344.2694379]
    [12] Devietti J, Lucia B, Ceze L, Oskin M. DMP:Deterministic shared memory multiprocessing. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2009. 85-96.[doi:10.1145/1508244.1508255]
    [13] Cui H, Simsa J, Lin Y, Li H, Blum B, Xu X, Yang J, Gibson GA, Bryant RE. Parrot:A practical runtime for deterministic, stable, and reliable threads. In:Proc. of the Symp. on Operating Systems Principles (SOSP). 2013. 388-405.[doi:10.1145/2517349. 2522735]
    [14] Pusukuri KK, Gupta R, Bhuyan AN. Thread tranquilizer:Dynamically reducing performance variation. ACM Trans. on Architecture and Code Optimization, 2012,8(4):46-66.[doi:10.1145/2086696.2086725]
    [15] Gao L, Wang R, Qian DP. Deterministic replay for parallel programs in multi-core processors. Ruan Jian Xue Bao/Journal of Software, 2013,24(6):1390-1402(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/4392.htm[doi:10.3724/SP.J. 1001.2013.04392]
    [16] Chen Y, Zhang S, Guo Q, Li L, Wu R, Chen T. Deterministic replay:A survey. ACM Computing Surveys (CSUR), 2015,48(2):17-None.[doi:10.1145/2790077]
    [17] Hong S, Kim M. A survey of race bug detection techniques for multithreaded programs. Journal of Software:Testing, Verification and Reliability, 2015,25(3):191-217.[doi:10.1002/stvr.1564]
    [18] Su XH, Yu Z, Wang TT, Ma PJ. A survey on exposing, deteting and avoiding concurrency bugs. Chinese Journal of Computers, 2015,38(11):2215-2233(in Chinese with English abstract).
    [19] Jiang Y, Gu T, Xu C, Ma X, Lu J. CARE:Cache guided deterministic replay for concurrent Java programs. In:Jalote P, Briand LC, van der Hoek A, eds. Proc. of the Int'l Conf. on Software Engineering (ICSE). ACM, 2014. 457-467.
    [20] Jiang Y, Li D, Xu C, Ma X, Lu J. Optimistic shared memory dependence tracing. In:Proc. of the Int'l Conf. on Automated Software Enginnering (ASE). 2015. 524-534.[doi:10.1109/ASE.2015.11]
    [21] Jiang Y, Xu C, Li D, Ma X, Lu J. Online shared memory dependence reduction via bisectional coordination. In:Proc. of the Symp. on the Foundations of Software Engineering (FSE). 2016. 822-832.[doi:10.1145/2950290.2950326]
    [22] Lamport L. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. on Computers, 1979,C-28(9):690-691.[doi:10.1109/TC.1979.1675439]
    [23] Huang J, Zhang C, Dolby J. CLAP:Recording local executions to reproduce concurrency failures. In:Proc. of the Conf. on Programming Language Design and Implementation (PLDI). 2013. 141-152.[doi:10.1145/2491956.2462167]
    [24] Adve SV, Boehm H. Memory models:A case for rethinking parallel languages and hardware. Communications of the ACM, 2010, 53(8):90-101.[doi:10.1145/1787234.1787255]
    [25] Ronsse M, De Bosschere K. RecPlay:A fully integrated practical record/replay system. ACM Trans. on Computer Systems, 1999, 17(2):133-152.[doi:10.1145/312203.312214]
    [26] Dinning A, Schonberg E. An empirical comparison of monitoring algorithms for access anomaly detection. In:Proc. of the Symp. on Principles and Practice of Parallel Programming (PPoPP). 1990. 1-10.[doi:10.1145/99163.99165]
    [27] Flanagan C, Freund SN. FastTrack:Efficient and precise dynamic race detection. In:Hind M, Diwan A, eds. Proc. of the Conf. on Programming Language Design and Implementation (PLDI). ACM, 2009. 121-133.
    [28] Huang J, Liu P, Zhang C. LEAP:Lightweight deterministic multi-processor replay of concurrent Java programs. In:Roman G-C, Sullivan KJ, eds. Proc. of the Symp. on the Foundations of Software Engineering (FSE). ACM, 2010. 385-386.
    [29] Yu Y, Rodeheffer T, Chen W. RaceTrack:Efficient detection of data race conditions via adaptive tracking. In:Proc. of the Symp. on Operating Systems Principles (SOSP). 2005. 221-234.[doi:10.1145/1095809.1095832]
    [30] Wilcox JR, Finch P, Flanagan C, Freund SN. Array shadow state compression for precise dynamic race detection. In:Proc. of the Int'l Conf. on Automated Software Enginnering (ASE). 2015. 155-165.[doi:10.1109/ASE.2015.19]
    [31] Huang J, Zhang C. An efficient static trace simplification technique for debugging concurrent programs. In:Proc. of the Int'l Conf. on Static Analysis (SAS). 2011. 163-179.[doi:10.1007/978-3-642-23702-7_15]
    [32] Netzer RHB. Optimal tracing and replay for debugging shared-memory parallel programs. In:Proc. of the Workshop on Parallel and Distributed Debugging (PADD). 1993. 1-11.[doi:10.1145/174266.174268]
    [33] Jalbert N, Sen K. A trace simplification technique for effective debugging of concurrent programs. In:Proc. of the Symp. on the Foundations of Software Engineering (FSE). 2010. 57-66.[doi:10.1145/1882291.1882302]
    [34] Bhansali S, Chen W, de Jong S, Edwards A, Murray R, Drinić M, Mihočka D, Chau J. Framework for instruction-level tracing and analysis of program executions. In:Proc. of the Int'l Conf. on Virtual Execution Environments (VEE). 2006. 154-163.[doi:10. 1145/1134760.1220164]
    [35] Bond MD, Kulkarni M, Cao M, Zhang M, Fathi Salmi M, Biswas S, Sengupta A, Huang J. OCTET:Capturing and controlling cross-thread dependences efficiently. In:Proc. of the Int'l Conf. on Object Oriented Programming Systems Languages and Applications (OOPSLA). 2013. 693-712.[doi:10.1145/2509136.2509519]
    [36] Bacon DF, Goldstein SC. Hardware-Assisted replay of multiprocessor programs. In:Proc. of the Workshop on Parallel and Distributed Debugging (PADD). 1991. 194-206.[doi:10.1145/122759.122777]
    [37] Attiya H, Guerraoui R, Hendler D, Kuznetsov P, Michael MM, Vechev M. Laws of order:Expensive synchronization in concurrent algorithms cannot be eliminated. In:Proc. of the Symp. on Principles of Programming Languages (POPL). 2011. 487-498.[doi:10. 1145/1926385.1926442]
    [38] Xu M, Bodik R, Hill MD. A flight data recorder for enabling full-system multiprocessor deterministic replay. In:Proc. of the Int'l Symp. on Computer Architecture (ISCA). 2003. 122-135.[doi:10.1145/859618.859633]
    [39] von Praun C, Gross TR. Object race detection. In:Proc. of the Int'l Conf. on Object Oriented Programming Systems Languages and Applications (OOPSLA). 2001. 70-82.[doi:10.1145/504282.504288]
    [40] Dunlap GW, Lucchetti DG, Fetterman MA, Chen PM. Execution replay of multiprocessor virtual machines. In:Proc. of the Int'l Conf. on Virtual Execution Environments (VEE). 2008. 121-130.[doi:10.1145/1346256.1346273]
    [41] Choi J, Gupta M, Serrano M, Sreedhar VC, Midkiff S. Escape analysis for Java. In:Proc. of the Int'l Conf. on Object Oriented Programming Systems Languages and Applications (OOPSLA). 1999. 1-19.[doi:10.1145/320384.320386]
    [42] Voung JW, Jhala R, Lerner S. RELAY:Static race detection on millions of lines of code. In:Crnkovic I, Bertolino A, eds. Proc. of the Joint Meeting of the European Software Engineering Conf. and the Symp. on the Foundations of Software Engineering (ESEC/FSE). ACM, 2007. 205-214.
    [43] Zamfir C, Candea G. Execution synthesis:A technique for automated software debugging. In:Proc. of the European Conf. on Computer Systems (EuroSys). 2010. 321-334.[doi:10.1145/1755913.1755946]
    [44] Huang J, Meredith PO, Rosu G. Maximal sound predictive race detection with control flow abstraction. In:Proc. of the Conf. on Programming Language Design and Implementation (PLDI). 2014. 337-348.[doi:10.1145/2594291.2594315]
    [45] Nieuwenhuis R, Oliveras A, Tinelli C. Solving SAT and SAT modulo theories:From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL. Journal of the ACM, 2006,53(6):937-977.[doi:10.1145/1217856.1217859]
    [46] Park S, Zhou Y, Xiong W, Yin Z, Kaushik R, Lee KH, Lu S. PRES:Probabilistic replay with execution sketching on multiprocessors. In:Proc. of the Symp. on Operating Systems Principles (SOSP). 2009. 177-192.[doi:10.1145/1629575.1629593]
    [47] Zhou J, Xiao X, Zhang C. Stride:Search-Based deterministic replay in polynomial time via bounded linkage. In:Proc. of the Int'l Conf. on Software Engineering (ICSE). 2012. 892-902.[doi:10.1109/ICSE.2012.6227130]
    [48] Savage S, Burrows M, Nelson G, Sobalvarro P, Anderson T. Eraser:A dynamic data race detector for multithreaded programs. ACM Trans. on Computer Systems, 1997,15(4):391-411.[doi:10.1145/265924.265927]
    [49] Serbanuta TF, Chen F, Rosu G. Maximal causal models for sequentially consistent systems. In:Proc. of the Int'l Conf. on Runtime Verification (RV). 2012. 136-150.[doi:10.1007/978-3-642-35632-2_16]
    [50] Smaragdakis Y, Evans J, Sadowski C, Yi J, Flanagan C. Sound predictive race detection in polynomial time. In:Proc. of the Symp. on Principles of Programming Languages (POPL). 2012. 387-400.[doi:10.1145/2103656.2103702]
    [51] Dolby J, Hammer C, Marino D, Tip F, Vaziri M, Vitek J. A data-centric approach to synchronization. ACM Trans. on Programming Languages and Systems, 2012,34(1):4:1-4:48.[doi:10.1145/2160910.2160913]
    [52] Harris T, Cristal A, Unsal OS, Ayguade E, Gagliardi F, Smith B, Valero M. Transactional memory:An overview. IEEE Micro, 2007,27(3):8-29.[doi:10.1109/MM.2007.63]
    [53] Yoo RM, Hughes CJ, Lai K, Rajwar R. Performance evaluation of Intel(R) transactional synchronization extensions for high-performance computing. In:Proc. of the Int'l Conf. for High Performance Computing (SC). 2013. 1-11.[doi:10.1145/2503210. 2503232]
    [54] Zhang M, Huang J, Cao M, Bond MD. Low-Overhead software transactional memory with progress guarantees and strong semantics. In:Proc. of the Symp. on Principles and Practice of Parallel Programming (PPoPP). 2015. 97-108.[doi:10.1145/2688500.2688510]
    [55] Min SL, Choi J. An efficient cache-based access anomaly detection scheme. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 1991. 235-244.[doi:10.1145/106972.106996]
    [56] Ananian CS, Asanovic K, Kuszmaul BC, Leiserson CE, Lie S. Unbounded transactional memory. IEEE Micro, 2006,26(1):59-69.[doi:10.1109/MM.2006.26]
    [57] Lucia B, Ceze L, Strauss K, Qadeer S, Boehm H. Conflict exceptions:Simplifying concurrent language semantics with precise hardware exceptions for data-races. In:Proc. of the Int'l Symp. on Computer Architecture (ISCA). 2010. 210-221.[doi:10.1145/1815961.1815987]
    [58] Hower DR, Hill MD. Rerun:Exploiting episodes for lightweight memory race recording. In:Proc. of the Int'l Symp. on Computer Architecture (ISCA). 2008. 265-276.[doi:10.1109/ISCA.2008.26]
    [59] Montesinos P, Ceze L, Torrellas J. DeLorean:Recording and deterministically replaying shared-memory multiprocessor execution efficiently. In:Proc. of the Int'l Symp. on Computer Architecture (ISCA). 2008. 289-300.[doi:10.1109/ISCA.2008.36]
    [60] Yang Z, Yang M, Zang B, Xu L, Chen H. ORDER:Object centric deterministic replay for Java. In:Nieh J, Waldspurger CA, eds. Proc. of the USENIX Annual Technical Conf. (ATC). USENIX Association, 2011. 1-14.
    [61] Ceze L, Tuck J, Torrellas J, Cascaval C. Bulk disambiguation of speculative threads in multiprocessors. In:Proc. of the Int'l Symp. on Computer Architecture (ISCA). 2006. 227-238.[doi:10.1109/ISCA.2006.13]
    [62] Ceze L, Tuck J, Montesinos P, Torrellas J. BulkSC:Bulk enforcement of sequential consistency. In:Proc. of the Int'l Symp. on Computer Architecture (ISCA). 2007. 278-289.[doi:10.1145/1250662.1250697]
    [63] Elmas T, Qadeer S, Tasiran S. Goldilocks:A race and transaction-aware Java runtime. In:Proc. of the Conf. on Programming Language Design and Implementation (PLDI). 2007. 245-255.[doi:10.1145/1250734.1250762]
    [64] Cherem S, Chilimbi T, Gulwani S. Inferring locks for atomic sections. In:Proc. of the Conf. on Programming Language Design and Implementation (PLDI). 2008. 304-315.[doi:10.1145/1375581.1375619]
    [65] Lee D, Chen PM, Flinn J, Narayanasamy S. Chimera:Hybrid program analysis for determinism. In:Proc. of the Conf. on Programming Language Design and Implementation (PLDI). 2012. 463-474.[doi:10.1145/2254064.2254119]
    [66] Xu M, Hill MD, Bodik R. A regulated transitive reduction (RTR) for longer memory race recording. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2006. 49-60.[doi:10.1145/1168857.1168865]
    [67] Chen Y, Hu W, Chen T, Wu R. LReplay:A pending period based deterministic replay scheme. In:Proc. of the Int'l Symp. on Computer Architecture (ISCA). 2010. 187-197.[doi:10.1145/1815961.1815985]
    [68] Berger ED, Yang T, Liu T, Novark G. Grace:Safe multithreaded programming for C/C++. In:Proc. of the Int'l Conf. on Object Oriented Programming Systems Languages and Applications (OOPSLA). 2009. 81-96.[doi:10.1145/1640089.1640096]
    [69] Liu T, Curtsinger C, Berger ED. Dthreads:Efficient deterministic multithreading. In:Proc. of the Symp. on Operating Systems Principles (SOSP). 2011. 327-336.[doi:10.1145/2043556.2043587]
    [70] Bergan T, Hunt N, Ceze L, Gribble SD. Deterministic process groups in dOS. In:Arpaci-Dusseau RH, Chen B, eds. Proc. of the Conf. on Operating Systems Design and Implementation (OSDI). USENIX Association, 2010. 177-191.
    [71] Patil H, Pereira C, Stallcup M, Lueck G, Cownie J. PinPlay:A framework for deterministic replay and reproducible analysis of parallel programs. In:Proc. of the Int'l Symp. on Code Generation and Optimization (CGO). 2010. 2-11.[doi:10.1145/1772954. 1772958]
    [72] Russell K, Detlefs D. Eliminating synchronization-related atomic operations with biased locking and bulk rebiasing. In:Proc. of the Int'l Conf. on Object Oriented Programming Systems Languages and Applications (OOPSLA). 2006. 263-272.[doi:10.1145/1167473.1167496]
    [73] Chen Y, Chen H. Scalable deterministic replay in a parallel full-system emulator. In:Proc. of the Symp. on Principles and Practice of Parallel Programming (PPoPP). 2013. 207-218.[doi:10.1145/2442516.2442537]
    [74] Cao M, Zhang M, Sengupta A, Bond MD. Drinking from both glasses:Combining pessimistic and optimistic tracking of cross-thread dependences. In:Proc. of the Symp. on Principles and Practice of Parallel Programming (PPoPP). 2016. 20:1-20:13.[doi:10. 1145/2851141.2851143]
    [75] Honarmand N, Torrellas J. RelaxReplay:Record and replay for relaxed-consistency multiprocessors. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2014. 223-238.[doi:10.1145/2541940.2541979]
    [76] Altekar G, Stoica I. ODR:Output-Deterministic replay for multicore debugging. In:Proc. of the Symp. on Operating Systems Principles (SOSP). 2009. 193-206.[doi:10.1145/1629575.1629594]
    [77] Netzer RH, Miller BP. On the complexity of event ordering for shared-memory parallel program executions. In:Wahhabi BW, ed. Proc. of the Int'l Conf. on Parallel Processing (ICPP). Pennsylvania State University Press, 1990. 93-97.
    [78] Gibbons PB, Korach E. Testing shared memories. SIAM Journal on Computing, 1997,26(4):1208-1244.[doi:10.1137/S0097539794279614]
    [79] Lee D, Said M, Narayanasamy S, Yang Z, Pereira C. Offline symbolic analysis for multi-processor execution replay. In:Albonesi DH, Martonosi M, August DI, Martínez JF, eds. Proc. of the Int'l Symp. on Microarchitecture (MICRO). ACM, 2009. 564-575.
    [80] Narayanasamy S, Pereira C, Calder B. Recording shared memory dependencies using strata. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2006. 229-240.[doi:10.1145/1168857.1168886]
    [81] Yuan X, Wu C, Wang Z, Li J, Yew P, Huang J, Feng X, Lan Y, Chen Y, Guan Y. ReCBuLC:Reproducing concurrency bugs using local clocks. In:Proc. of the Int'l Conf. on Software Engineering (ICSE). 2015. 824-834.[doi:10.1109/ICSE.2015.94]
    [82] Lee D, Said M, Narayanasamy S, Yang Z. Offline symbolic analysis to infer total store order. In:Proc. of the 2011 Int'l Symp. on High Performance Computer Architecture (HPCA). 2011. 357-358.[doi:10.1109/HPCA.2011.5749743]
    [83] Liu P, Zhang X, Tripp O, Zheng Y. Light:Replay via tightly bounded recording. In:Proc. of the Conf. on Programming Language Design and Implementation (PLDI). 2015. 55-64.[doi:10.1145/2737924.2738001]
    [84] Lamport L. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 1978,21(7):558-565.[doi:10.1145/359545.359563]
    [85] Huang J, Luo Q, Rosu G. GPredict:Generic predictive concurrency analysis. In:Proc. of the Int'l Conf. on Software Engineering (ICSE). 2015. 847-857.[doi:10.1109/ICSE.2015.96]
    [86] Huang J, Zhang C. Persuasive prediction of concurrency access anomalies. In:Proc. of the Int'l Symp. on Software Testing and Analysis (ISSTA). 2011. 144-154.[doi:10.1145/2001420.2001438]
    [87] Liu T, Berger ED. SHERIFF:Precise detection and automatic mitigation of false sharing. In:Proc. of the Int'l Conf. on Object Oriented Programming Systems Languages and Applications (OOPSLA). 2011. 3-18.[doi:10.1145/2048066.2048070]
    [88] Musuvathi M, Qadeer S, Ball T, Basler G, Nainar PA, Neamtiu I. Finding and reproducing Heisenbugs in concurrent programs. In:Draves R, van Renesse R, eds. Proc. of the Conf. on Operating Systems Design and Implementation (OSDI). USENIX Association, 2008. 267-280.
    [89] Park S, Lu S, Zhou Y. CTrigger:Exposing atomicity violation bugs from their hiding places. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2009. 25-36.[doi:10.1145/1508244.1508249]
    [90] Cai Y, Cao L. Effective and precise dynamic detection of hidden races for Java programs. In:Proc. of the Joint Meeting of the European Software Engineering Conf. and the Symp. on the Foundations of Software Engineering (ESEC/FSE). 2015. 450-461.[doi:10.1145/2786805.2786839]
    [91] Dice D, Shavit N. TLRW:Return of the read-write lock. In:Proc. of the Symp. on Parallelism in Algorithms and Architectures (SPAA). 2010. 284-293.[doi:10.1145/1810479.1810531]
    [92] Dalessandro L, Spear MF, Scott ML. NOrec:Streamlining STM by abolishing ownership records. In:Proc. of the Symp. on Principles and Practice of Parallel Programming (PPoPP). 2010. 67-78.[doi:10.1145/1693453.1693464]
    [93] Biswas S, Zhang M, Bond MD, Lucia B. Valor:Efficient, software-only region conflict exceptions. In:Aldrich J, Eugster P, eds. Proc. of the Int'l Conf. on Object Oriented Programming Systems Languages and Applications (OOPSLA). USENIX Association, 2015. 241-259.
    [94] Bergan T, Anderson O, Devietti J, Ceze L, Grossman D. CoreDet:A compiler and runtime system for deterministic multithreaded execution. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2010. 53-64.[doi:10.1145/1736020.1736029]
    [95] Cui H, Wu J, Tsai C, Yang J. Stable deterministic multithreading through schedule memoization. In:Arpaci-Dusseau RH, Chen B, eds. Proc. of the Conf. on Operating Systems Design and Implementation (OSDI). USENIX Association, 2010. 207-221.
    [96] Cui H, Wu J, Gallagher J, Guo H, Yang J. Efficient deterministic multithreading through schedule relaxation. In:Proc. of the Symp. on Operating Systems Principles (SOSP). 2011. 337-351.[doi:10.1145/2043556.2043588]
    [97] Zhang T, Lee D, Jung C. TxRace:Efficient data race detection using commodity hardware transactional memory. In:Proc. of the Architectural Support for Programming Languages and Operating Systems (ASPLOS). 2016. 159-173.[doi:10.1145/2872362. 2872384]
    [98] Wu M, Long F, Wang X, Xu Z, Lin H, Liu X, Guo Z, Guo H, Zhou L, Zhang Z. Language-based replay via data flow cut. In:Proc. of the Symp. on the Foundations of Software Engineering (FSE). 2010. 197-206.[doi:10.1145/1882291.1882322]
    附中文参考文献:
    [15] 高岚,王锐,钱德沛.多核处理器并行程序的确定性重放研究.软件学报,2013,24(6):1390-1402. http://www.jos.org.cn/1000-9825/4392.htm[doi:10.3724/SP.J.1001.2013.04392]
    [18] 苏小红,禹振,王甜甜,马培军.并发缺陷暴露、检测与规避研究综述.计算机学报,2015,38(11):2215-2233.
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

蒋炎岩,许畅,马晓星,吕建.获取访存依赖:并发程序动态分析基础技术综述.软件学报,2017,28(4):747-763

复制
分享
文章指标
  • 点击次数:4330
  • 下载次数: 7475
  • HTML阅读次数: 3611
  • 引用次数: 0
历史
  • 收稿日期:2016-06-19
  • 最后修改日期:2016-09-08
  • 在线发布日期: 2017-01-24
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19822591位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号