{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:57:47Z","timestamp":1649120267281},"reference-count":36,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2014edp7347","type":"journal-article","created":{"date-parts":[[2015,1,31]],"date-time":"2015-01-31T17:09:48Z","timestamp":1422724188000},"page":"334-345","source":"Crossref","is-referenced-by-count":0,"title":["Biped: Bidirectional Prediction of Order Violations"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Xi","family":"CHANG","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuo","family":"ZHANG","sequence":"additional","affiliation":[{"name":"College of Computer, National University of Defense Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"LEI","sequence":"additional","affiliation":[{"name":"College of Computer, National University of Defense Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianjun","family":"ZHAO","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, and T.E. Anderson, \u201cEraser: A dynamic data race detector for multithreaded programs,\u201d ACM Trans. Comput. Syst., vol.15, no.4, pp.391-411, 1997.","DOI":"10.1145\/265924.265927"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Naik, C.-S. Park, K. Sen, and D. Gay, \u201cEffective static deadlock detection,\u201d ICSE, 2009, pp.386-396, 2009.","DOI":"10.1109\/ICSE.2009.5070538"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] P. Joshi, C.-S. Park, K. Sen, and M. Naik, \u201cA randomized dynamic program analysis technique for detecting real deadlocks,\u201d PLDI, 2009, pp.110-120, 2009.","DOI":"10.1145\/1542476.1542489"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] P. Joshi, M. Naik, K. Sen, and D. Gay, \u201cAn effective dynamic analysis for detecting generalized deadlocks,\u201d SIGSOFT FSE, 2010, pp.327-336, 2010.","DOI":"10.1145\/1882291.1882339"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] C. Flanagan and S.N. Freund, \u201cAtomizer: A dynamic atomicity checker for multithreaded programs (summary),\u201d IPDPS, 2004, 2004.","DOI":"10.1145\/964001.964023"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S. Lu, S. Park, E. Seo, and Y. Zhou, \u201cLearning from mistakes: A comprehensive study on real world concurrency bug characteristics,\u201d ASPLOS, 2008, pp.329-339, 2008.","DOI":"10.1145\/1353534.1346323"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] K. Sen, \u201cRace directed random testing of concurrent programs,\u201d PLDI, 2008, pp.11-21, 2008.","DOI":"10.1145\/1375581.1375584"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M. Naik, A. Aiken, and J. Whaley, \u201cEffective static race detection for java,\u201d PLDI, 2006, pp.308-319, 2006.","DOI":"10.1145\/1133981.1134018"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] E. Bodden and K. Havelund, \u201cRacer: effective race detection using aspectj,\u201d ISSTA, 2008, pp.155-166, 2008.","DOI":"10.1145\/1390630.1390650"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] D. Marino, M. Musuvathi, and S. Narayanasamy, \u201cLiterace: effective sampling for lightweight data-race detection,\u201d PLDI, 2009, pp.134-143, 2009.","DOI":"10.1145\/1542476.1542491"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] C. Flanagan and S. Freund, \u201cFasttrack: efficient and precise dynamic race detection,\u201d PLDI, 2009, pp.121-133, 2009.","DOI":"10.1145\/1542476.1542490"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] M.D. Bond, K.E. Coons, and K.S. McKinley, \u201cPacer: proportional detection of data races,\u201d PLDI, 2010, pp.255-268, 2010.","DOI":"10.1145\/1806596.1806626"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] S. Narayanasamy, Z. Wang, J. Tigani, A. Edwards, and B. Calder, \u201cAutomatically classifying benign and harmful data racesallusing replay analysis,\u201d PLDI, 2007, pp.22-31, 2007.","DOI":"10.1145\/1250734.1250738"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] C.-S. Park and K. Sen, \u201cRandomized active atomicity violation detection in concurrent programs,\u201d SIGSOFT FSE, 2008, pp.135-145, 2008.","DOI":"10.1145\/1453101.1453121"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] C. Flanagan, S.N. Freund, and J. Yi, \u201cVelodrome: a sound and complete dynamic atomicity checker for multithreaded programs,\u201d PLDI, 2008, pp.293-303, 2008.","DOI":"10.1145\/1375581.1375618"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] F. Sorrentino, A. Farzan, and P. Madhusudan, \u201cPenelope: weaving threads to expose atomicity violations,\u201d SIGSOFT FSE, 2010, pp.37-46, 2010.","DOI":"10.1145\/1882291.1882300"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] S. Park, S. Lu, and Y. Zhou, \u201cCtrigger: exposing atomicity violation bugs from their hiding places,\u201d ASPLOS, 2009, pp.25-36, 2009.","DOI":"10.1145\/1508284.1508249"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] S. Lu, S. Park, and Y. Zhou, \u201cFinding atomicity-violation bugs through unserializable interleaving testing,\u201d IEEE Trans. Softw. Eng., vol.38, no.4, pp.844-860, 2012.","DOI":"10.1109\/TSE.2011.35"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] B. Lucia, L. Ceze, and K. Strauss, \u201cColorsafe: architectural support for debugging and dynamically avoiding multi-variable atomicity violations,\u201d ISCA, 2010, pp.222-233, 2010.","DOI":"10.1145\/1816038.1815988"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] J. Yu and S. Narayanasamy, \u201cA case for an interleaving constrained shared-memory multi-processor,\u201d ISCA, 2009, pp.325-336, 2009.","DOI":"10.1145\/1555815.1555796"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] Y. Shi, S. Park, Z. Yin, S. Lu, Y. Zhou, W. Chen, and W. Zheng, \u201cDo i use the wrong definition?: Defuse: definition-use invariants for detecting concurrency and sequential bugs,\u201d OOPSLA, 2010, pp.160-174, 2010.","DOI":"10.1145\/1932682.1869474"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] K. Sen, G. Rosu, and G. Agha, \u201cDetecting errors in multithreaded programs by generalized predictive analysis of executions,\u201d FMOODS, 2005, pp.211-226, 2005.","DOI":"10.1007\/11494881_14"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] L. Wang and S. Stoller, \u201cAccurate and efficient runtime detection of atomicity errors in concurrent programs,\u201d in PPOPP, 2006, pp.137-146, 2006.","DOI":"10.1145\/1122971.1122993"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] A. Farzan, P. Madhusudan, and F. Sorrentino, \u201cMeta-analysis for atomicity violations under nested locking,\u201d CAV, 2009, pp.248-262, 2009.","DOI":"10.1007\/978-3-642-02658-4_21"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] C. Wang, S. Kundu, M.K. Ganai, and A. Gupta, \u201cSymbolic predictive analysis for concurrent programs,\u201d FM, 2009, pp.256-272, 2009.","DOI":"10.1007\/978-3-642-05089-3_17"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] W. Zhang, C. Sun, and S. Lu, \u201cConmem: detecting severe concurrency bugs through an effect-oriented approach,\u201d ASPLOS, 2010, pp.179-192, 2010.","DOI":"10.1145\/1735971.1736041"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] J. Huang and C. Zhang, \u201cPersuasive prediction of concurrency access anomalies,\u201d ISSTA, 2011, pp.144-154, 2011.","DOI":"10.1145\/2001420.2001438"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] R. O'Callahan and J.-D. Choi, \u201cHybrid dynamic data race detection,\u201d PPOPP, 2003, pp.167-178, 2003.","DOI":"10.1145\/966049.781528"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] L. Lamport, \u201cTime, clocks, and the ordering of events in a distributed system,\u201d Commun. ACM, vol.21, no.7, pp.558-565, 1978.","DOI":"10.1145\/359545.359563"},{"key":"30","unstructured":"[30] \u201cSoot-a java optimization framework,\u201d Proc. 1999 Conference of the Centre for Advanced Studies on Collaborative Research, pp.125-135, 1999."},{"key":"31","unstructured":"[31] E. Farchi, Y. Nir, and S. Ur, \u201cConcurrent bug patterns and how to test them,\u201d IPDPS, 2003, p.286, 2003."},{"key":"32","doi-asserted-by":"crossref","unstructured":"[32] P. Joshi, M. Naik, C.-S. Park, and K. Sen, \u201cCalfuzzer: An extensible active testing framework for concurrent programs,\u201d CAV, 2009, pp.675-681, 2009.","DOI":"10.1007\/978-3-642-02658-4_54"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] C. Wang, M. Said, and A. Gupta, \u201cCoverage guided systematic concurrency testing,\u201d ICSE, 2011, pp.221-230, 2011.","DOI":"10.1145\/1985793.1985824"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] N. Sinha and C. Wang, \u201cStaged concurrent program analysis,\u201d SIGSOFT FSE, 2010, pp.47-56, 2010.","DOI":"10.1145\/1882291.1882301"},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] V. Kahlon and C. Wang, \u201cUniversal causality graphs: A precise happens-before model for detecting bugs in concurrent programs,\u201d CAV, 2010, pp.434-449, 2010.","DOI":"10.1007\/978-3-642-14295-6_39"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] Z. Lai, S.-C. Cheung, and W.K. Chan, \u201cDetecting atomic-set serializability violations in multithreaded programs through active randomized testing,\u201d ICSE (1), 2010, pp.235-244, 2010.","DOI":"10.1145\/1806799.1806836"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/2\/E98.D_2014EDP7347\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T07:49:10Z","timestamp":1566287350000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/2\/E98.D_2014EDP7347\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014edp7347","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}