{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T23:40:07Z","timestamp":1746402007857,"version":"3.40.4"},"reference-count":31,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2014]]},"DOI":"10.1587\/transinf.2014edp7067","type":"journal-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T01:02:15Z","timestamp":1412125335000},"page":"2676-2684","source":"Crossref","is-referenced-by-count":1,"title":["DRDet: Efficiently Making Data Races Deterministic"],"prefix":"10.1587","volume":"E97.D","author":[{"given":"Chen","family":"CHEN","sequence":"first","affiliation":[{"name":"National Laboratory for Parallel and Distributed Processing, National University of Defense Technology"},{"name":"School of Computer, National University of Defense Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"LU","sequence":"additional","affiliation":[{"name":"National Laboratory for Parallel and Distributed Processing, National University of Defense Technology"},{"name":"School of Computer, National University of Defense Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoping","family":"WANG","sequence":"additional","affiliation":[{"name":"National Laboratory for Parallel and Distributed Processing, National University of Defense Technology"},{"name":"School of Computer, National University of Defense Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"ZHOU","sequence":"additional","affiliation":[{"name":"National Laboratory for Parallel and Distributed Processing, National University of Defense Technology"},{"name":"School of Computer, National University of Defense Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhendong","family":"WU","sequence":"additional","affiliation":[{"name":"National Laboratory for Parallel and Distributed Processing, National University of Defense Technology"},{"name":"School of Computer, National University of Defense Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"doi-asserted-by":"crossref","unstructured":"[1] J. Devietti, B. Lucia, L. Ceze, and M. Oskin, \u201cDMP: Deterministic shared memory multiprocessing,\u201d Proc. 14th International Conference on Architectural Support for Programming Languages and Operating Systems, Washington, DC, USA, pp.85-96, 2009.","key":"1","DOI":"10.1145\/1508244.1508255"},{"doi-asserted-by":"crossref","unstructured":"[2] T. Bergan, O. Anderson, J. Devietti, L. Ceze, and D. Grossman, \u201cCoreDet: A compiler and runtime system for deterministic multithreaded execution,\u201d Proc. Fifteenth Edition of ASPLOS on Architectural Support for Programming Languages and Operating Systems, Pittsburgh, Pennsylvania, USA, pp.53-64, 2010.","key":"2","DOI":"10.1145\/1736020.1736029"},{"unstructured":"[3] T. Bergan, N. Hunt, L. Ceze, and S.D. Gribble, \u201cDeterministic process groups in dOS,\u201d Proc. 9th USENIX Conference on Operating Systems Design and Implementation, pp.177-192, 2010.","key":"3"},{"unstructured":"[4] A. Amittai, W. Shu-Chun, H. Sen, and F. Bryan, \u201cEfficient system-enforced deterministic parallelism,\u201d Proc. 9th USENIX Conference on Operating Systems Design and Implementation, Vancouver, BC, Canada, pp.1-16, 2010.","key":"4"},{"doi-asserted-by":"crossref","unstructured":"[5] D.R. Hower, P. Dudnik, M.D. Hill, and D.A. Wood, \u201cCalvin: Deterministic or not? Free will to choose,\u201d High Performance Computer Architecture (HPCA), pp.333-344, 2011.","key":"5","DOI":"10.1109\/HPCA.2011.5749741"},{"doi-asserted-by":"crossref","unstructured":"[6] J. Devietti, J. Nelson, T. Bergan, L. Ceze, and D. Grossman, \u201cRCDC: A relaxed consistency deterministic computer,\u201d Proc. Sixteenth International Conference on Architectural Support for Programming Languages and Operating Systems, Newport Beach, California, USA, pp.67-78, 2011.","key":"6","DOI":"10.1145\/1961296.1950376"},{"doi-asserted-by":"crossref","unstructured":"[7] X. Zhou, K. Lu, X. Wang, and X. Li, \u201cExploiting parallelism in deterministic shared memory multiprocessing,\u201d J. Parallel Distrib. Comput., vol.72, no.5, pp.716-727, 2012.","key":"7","DOI":"10.1016\/j.jpdc.2012.02.008"},{"doi-asserted-by":"crossref","unstructured":"[8] N. Hunt, T. Bergan, L. Ceze, and S.D. Gribble, \u201cDDOS: Taming nondeterminism in distributed systems,\u201d Proc. Eighteenth International Conference on Architectural Support for Programming Languages and Operating Systems, pp.499-508, 2013.","key":"8","DOI":"10.1145\/2499368.2451170"},{"doi-asserted-by":"crossref","unstructured":"[9] M. Olszewski, J. Ansel, and S. Amarasinghe, \u201cKendo: Efficient deterministic multithreading in software,\u201d Proc. 14th International Conference on Architectural Support for Programming Languages and Operating Systems, pp.97-108, 2009.","key":"9","DOI":"10.1145\/1508244.1508256"},{"doi-asserted-by":"crossref","unstructured":"[10] H. Cui, J. Simsa, Y.-H. Lin, H. Li, B. Blum, X. Xu, J. Yang, G.A. Gibson, and R.E. Bryant, \u201cParrot: A practical runtime for deterministic, stable, and reliable threads,\u201d Proc. Twenty-Fourth ACM Symposium on Operating Systems Principles, pp.388-405, 2013.","key":"10","DOI":"10.1145\/2517349.2522735"},{"doi-asserted-by":"crossref","unstructured":"[11] C. Chen, K. Lu, X. Wang, X. Zhou, and L. Fang, \u201cPruning false positives of static data-race detection via thread specialization,\u201d Advanced Parallel Processing Technologies, pp.77-90, Springer, 2013.","key":"11","DOI":"10.1007\/978-3-642-45293-2_6"},{"doi-asserted-by":"crossref","unstructured":"[12] S.C. Woo, M. Ohara, E. Torrie, J.P. Singh, and A. Gupta, \u201cThe SPLASH-2 programs: Characterization and methodological considerations,\u201d ISCA, pp.24-36, 1995.","key":"12","DOI":"10.1145\/225830.223990"},{"unstructured":"[13] M. Das, G. Southern, and J. Renau, \u201cReducing logging overhead for deterministic execution,\u201d in Workshop on Determinism and Correctness in Parallel Programming (WoDet), 2013.","key":"13"},{"doi-asserted-by":"crossref","unstructured":"[14] J.W. Voung, R. Jhala, and S. Lerner, \u201cRELAY: Static race detection on millions of lines of code,\u201d Proc. 6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp.205-214, 2007.","key":"14","DOI":"10.1145\/1287624.1287654"},{"doi-asserted-by":"crossref","unstructured":"[15] B. Steensgaard, \u201cPoints-to analysis in almost linear time,\u201d Proc. 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.32-41, 1996.","key":"15","DOI":"10.1145\/237721.237727"},{"unstructured":"[16] L.O. Andersen, \u201cProgram analysis and specialization for the C programming language,\u201d Ph.D. thesis, DIKU, University of Cophenhagen, 1994.","key":"16"},{"doi-asserted-by":"crossref","unstructured":"[17] C. Lattner and V. Adve, \u201cLLVM: A compilation framework for lifelong program analysis & transformation,\u201d CGO, pp.75-86, 2004.","key":"17","DOI":"10.1109\/CGO.2004.1281665"},{"unstructured":"[18] M. Hill and M. Xu, \u201cRacey: A stress test for deterministic execution,\u201d Available: http:\/\/www.cs.wisc.edu\/~markhill\/racey.html","key":"18"},{"doi-asserted-by":"crossref","unstructured":"[19] E.D. Berger, T. Yang, T. Liu, and G. Novark, \u201cGrace: Safe multithreaded programming for C\/C++,\u201d OOPSLA, pp.81-96, 2009.","key":"19","DOI":"10.1145\/1639949.1640096"},{"doi-asserted-by":"crossref","unstructured":"[20] K. Lu, X. Zhou, X. Wang, W. Zhang, and G. Li, \u201cRaceFree: An efficient multi-threading model for determinism,\u201d PPoPP, pp.297-298, Shenzhen, China, 2013.","key":"20","DOI":"10.1145\/2517327.2442553"},{"doi-asserted-by":"crossref","unstructured":"[21] T. Liu, C. Curtsinger, and E.D. Berger, \u201cDTHREADS: Efficient deterministic multithreading,\u201d Proc. 22nd ACM Symposium on Operating Systems Principles, pp.327-336, 2011.","key":"21","DOI":"10.1145\/2043556.2043587"},{"doi-asserted-by":"crossref","unstructured":"[22] H. Cui, J. Wu, and J. Yang, \u201cStable deterministic multithreading through schedule memoization,\u201d 9th OSDI, pp.207-222, 2010.","key":"22","DOI":"10.1145\/2043556.2043588"},{"doi-asserted-by":"crossref","unstructured":"[23] H. Cui, J. Wu, J. Gallagher, H. Guo, and J. Yang, \u201cEfficient deterministic multithreading through schedule relaxation,\u201d SOSP'11, Cascais, Portugal, pp.337-351, 2011.","key":"23","DOI":"10.1145\/2043556.2043588"},{"doi-asserted-by":"crossref","unstructured":"[24] J. Yang, H. Cui, J. Wu, Y. Tang, and G. Hu, \u201cDeterminism is not enough: Making parallel programs reliable with stable multithreading,\u201d Commun. ACM, vol.57, no.3, pp.58-69, 2014.","key":"24","DOI":"10.1145\/2500875"},{"doi-asserted-by":"crossref","unstructured":"[25] J. Wu, Y. Tang, G. Hu, H. Cui, and J. Yang, \u201cSound and precise analysis of parallel programs through schedule specialization,\u201d Proc. 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.205-216, 2012.","key":"25","DOI":"10.1145\/2345156.2254090"},{"doi-asserted-by":"crossref","unstructured":"[26] D. Englerand and K. Ashcraft, \u201cRacerX: Effective, static detection of race conditions and deadlocks,\u201d 19th ACM Symposiumon Operating Systems Principles (SOSP), pp.237-252, Oct. 2003.","key":"26","DOI":"10.1145\/1165389.945468"},{"doi-asserted-by":"crossref","unstructured":"[27] V. Kahlon, N. Sinha, E. Kruus, and Y. Zhang, \u201cStatic data race detection for concurrent programs with asynchronous calls,\u201d Proc. 7th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp.13-22, 2009.","key":"27","DOI":"10.1145\/1595696.1595701"},{"doi-asserted-by":"crossref","unstructured":"[28] P. Pratikakis, J.S. Foster, and M. Hicks, \u201cLocksmith: Practical static race detection for C,\u201d ACM Trans. Programming Languages and Systems (TOPLAS), vol.33, pp.1-55, 2011.","key":"28","DOI":"10.1145\/1889997.1890000"},{"unstructured":"[29] N. Sterling, \u201cWarlock: A static data race analysis tool,\u201d USENIX Winter Technical Conference, pp.97-106, 1993.","key":"29"},{"doi-asserted-by":"crossref","unstructured":"[30] D. Lee, P.M. Chen, J. Flinn, and S. Narayanasamy, \u201cChimera: Hybrid program analysis for determinism,\u201d PLDI, Beijing, China, pp.463-474, 2012.","key":"30","DOI":"10.1145\/2345156.2254119"},{"unstructured":"[31] X. Zhou, K. Lu, X. Wang, W. Zhang, K. Zhang, X. Li, and G. Li, \u201cDeterministic message passing for distributed parallel computing,\u201d IEICE Trans. Inf. & Syst., vol.E96-D, no.5, pp.1068-1077, May 2013.","key":"31"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E97.D\/10\/E97.D_2014EDP7067\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T23:07:14Z","timestamp":1746400034000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E97.D\/10\/E97.D_2014EDP7067\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":31,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2014]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014edp7067","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2014]]}}}