{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:28:45Z","timestamp":1725586125518},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642219337"},{"type":"electronic","value":"9783642219344"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21934-4_29","type":"book-chapter","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T18:12:27Z","timestamp":1308334347000},"page":"355-369","source":"Crossref","is-referenced-by-count":4,"title":["Flow Sensitive-Insensitive Pointer Analysis Based Memory Safety for Multithreaded Programs"],"prefix":"10.1007","author":[{"given":"Mohamed A.","family":"El-Zawawy","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45789-5_18","volume-title":"Static Analysis","author":"S. Adams","year":"2002","unstructured":"Adams, S., Ball, T., Das, M., Lerner, S., Rajamani, S.K., Seigle, M., Weimer, W.: Speeding up dataflow analysis using flow-insensitive pointer analysis. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, p. 230. Springer, Heidelberg (2002)"},{"issue":"13","key":"29_CR2","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/S0950-5849(02)00105-2","volume":"44","author":"P. Anderson","year":"2002","unstructured":"Anderson, P., Binkley, D., Rosay, G., Teitelbaum, T.: Flow insensitive points-to sets. Information & Software Technology\u00a044(13), 743\u2013754 (2002)","journal-title":"Information & Software Technology"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/964001.964003","volume-title":"POPL","author":"N. Benton","year":"2004","unstructured":"Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: Jones, N.D., Leroy, X. (eds.) POPL, pp. 14\u201325. ACM, New York (2004)"},{"key":"29_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-32275-7_23","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"L. Beringer","year":"2005","unstructured":"Beringer, L., Hofmann, M., Momigliano, A., Shkaravska, O.: Automatic certification of heap consumption. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 347\u2013362. Springer, Heidelberg (2005)"},{"issue":"3","key":"29_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2006.08.012","volume":"364","author":"F. Besson","year":"2006","unstructured":"Besson, F., Jensen, T.P., Pichardie, D.: Proof-carrying code from certified abstract interpretation and fixpoint compression. Theor. Comput. Sci.\u00a0364(3), 273\u2013291 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"29_CR6","first-page":"98","volume":"8","author":"M.A. El-Zawawy","year":"2011","unstructured":"El-Zawawy, M.A.: Program optimization based pointer analysis and live stack-heap analysis. International Journal of Computer Science Issues\u00a08(2), 98\u2013107 (2011)","journal-title":"International Journal of Computer Science Issues"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1708016.1708020","volume-title":"TLDI","author":"P. Gerakios","year":"2010","unstructured":"Gerakios, P., Papaspyrou, N., Sagonas, K.F.: Race-free and memory-safe multithreading: design and implementation in cyclone. In: Kennedy, A., Benton, N. (eds.) TLDI, pp. 15\u201326. ACM, New York (2010)"},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/1480881.1480911","volume-title":"POPL","author":"B. Hardekopf","year":"2009","unstructured":"Hardekopf, B., Lin, C.: Semi-sparse flow-sensitive pointer analysis. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 226\u2013238. ACM, New York (2009)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Hind, M.: Pointer analysis: haven\u2019t we solved this problem yet? In: PASTE, pp. 54\u201361 (2001)","DOI":"10.1145\/379605.379665"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Hind, M., Pioli, A.: Which pointer analysis should i use? In: ISSTA, pp. 113\u2013123 (2000)","DOI":"10.1145\/347324.348916"},{"issue":"10","key":"29_CR11","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. Hoare","year":"1969","unstructured":"Hoare, C.: An axiomatic basis for computer programming. Commun. ACM\u00a012(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-03275-2_32","volume-title":"Parallel Computing Technologies","author":"B.-C. Kim","year":"2009","unstructured":"Kim, B.-C., Jun, S.-W., Hwang, D.J., Jun, Y.-K.: Visualizing potential deadlocks in multithreaded programs. In: Malyshkin, V. (ed.) PaCT 2009. LNCS, vol.\u00a05698, pp. 321\u2013330. Springer, Heidelberg (2009)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Knoop, J., Steffen, B.: Code motion for explicitly parallel programs. In: PPOPP, pp. 13\u201324 (1999)","DOI":"10.1145\/301104.301106"},{"issue":"3","key":"29_CR14","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.tcs.2006.08.013","volume":"364","author":"P. Laud","year":"2006","unstructured":"Laud, P., Uustalu, T., Vene, V.: Type systems equivalent to data-flow analyses for imperative languages. Theor. Comput. Sci.\u00a0364(3), 292\u2013310 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/BFb0032687","volume-title":"Languages and Compilers for Parallel Computing","author":"J. Lee","year":"1998","unstructured":"Lee, J., Midkiff, S.P., Padua, D.A.: Concurrent static single assignment form and constant propagation for explicitly parallel programs. In: Huang, C.-H., Sadayappan, P., Sehr, D. (eds.) LCPC 1997. LNCS, vol.\u00a01366, pp. 114\u2013130. Springer, Heidelberg (1998)"},{"key":"29_CR16","first-page":"263","volume-title":"PDCAT","author":"K.-Y. Leung","year":"2009","unstructured":"Leung, K.-Y., Huang, Z., Huang, Q., Werstein, P.: Maotai 2.0: Data race prevention in view-oriented parallel programming. In: PDCAT, pp. 263\u2013271. IEEE Computer Society, Los Alamitos (2009)"},{"key":"29_CR17","unstructured":"Midkiff, S.P., Padua, D.A.: Issues in the optimization of parallel programs. In: Padua, D.A. (ed.) ICPP (2), pp. 105\u2013113. Pennsylvania State University Press (1990)"},{"issue":"5","key":"29_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1387673.1387678","volume":"30","author":"M. Naik","year":"2008","unstructured":"Naik, M., Palsberg, J.: A type system equivalent to a model checker. ACM Trans. Program. Lang. Syst.\u00a030(5), 1\u201324 (2008)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"6","key":"29_CR19","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.scico.2009.07.009","volume":"75","author":"R.D. Nicola","year":"2010","unstructured":"Nicola, R.D., Gorla, D., Hansen, R.R., Nielson, F., Nielson, H.R., Probst, C.W., Pugliese, R.: From flow logic to static type systems for coordination languages. Sci. Comput. Program.\u00a075(6), 376\u2013397 (2010)","journal-title":"Sci. Comput. Program."},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-36377-7_11","volume-title":"The Essence of Computation","author":"H. Riis Nielson","year":"2002","unstructured":"Riis Nielson, H., Nielson, F.: Flow logic: A multi-paradigmatic approach to static analysis. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol.\u00a02566, pp. 223\u2013244. Springer, Heidelberg (2002)"},{"issue":"4","key":"29_CR21","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/210184.210187","volume":"17","author":"J. Palsberg","year":"1995","unstructured":"Palsberg, J., O\u2019Keefe, P.: A type system equivalent to flow analysis. ACM Trans. Program. Lang. Syst.\u00a017(4), 576\u2013599 (1995)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"29_CR22","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/596980.596982","volume":"25","author":"R. Rugina","year":"2003","unstructured":"Rugina, R., Rinard, M.C.: Pointer analysis for structured parallel programs. ACM Trans. Program. Lang. Syst.\u00a025(1), 70\u2013116 (2003)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00722-4_1","volume-title":"Compiler Construction","author":"V. Sarkar","year":"2009","unstructured":"Sarkar, V.: Challenges in code optimization of parallel programs. In: de Moor, O., Schwartzbach, M.I. (eds.) CC 2009. LNCS, vol.\u00a05501, pp. 1\u20131. Springer, Heidelberg (2009)"},{"issue":"11","key":"29_CR24","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1002\/spe.922","volume":"39","author":"C. Tian","year":"2009","unstructured":"Tian, C., Nagarajan, V., Gupta, R., Tallam, S.: Automated dynamic detection of busy-wait synchronizations. Softw., Pract. Exper.\u00a039(11), 947\u2013972 (2009)","journal-title":"Softw., Pract. Exper."},{"issue":"2-4","key":"29_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10817-009-9121-1","volume":"42","author":"S. Tlili","year":"2009","unstructured":"Tlili, S., Debbabi, M.: Interprocedural and flow-sensitive type analysis for memory and type safety of c code. J. Autom. Reasoning\u00a042(2-4), 265\u2013300 (2009)","journal-title":"J. Autom. Reasoning"},{"issue":"2","key":"29_CR26","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11390-009-9229-0","volume":"24","author":"J. Wang","year":"2009","unstructured":"Wang, J., Ma, X., Dong, W., Xu, H.-F., Liu, W.: Demand-driven memory leak detection based on flow- and context-sensitive pointer analysis. J. Comput. Sci. Technol.\u00a024(2), 347\u2013356 (2009)","journal-title":"J. Comput. Sci. Technol."},{"key":"29_CR27","unstructured":"Wang, Y., Kelly, T., Kudlur, M., Lafortune, S., Mahlke, S.A.: Gadara: Dynamic deadlock avoidance for multithreaded programs. In: Draves, R., van Renesse, R. (eds.) OSDI, pp. 281\u2013294. USENIX Association (2008)"},{"issue":"1","key":"29_CR28","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TPDS.2009.38","volume":"21","author":"X. Xiao","year":"2010","unstructured":"Xiao, X., Lee, J.J.: A true o(1) parallel deadlock detection algorithm for single-unit resource systems and its hardware implementation. IEEE Trans. Parallel Distrib. Syst.\u00a021(1), 4\u201319 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"29_CR29","first-page":"131","volume-title":"CIT","author":"C. Xu","year":"2010","unstructured":"Xu, C., Che, Y., Fang, J., Wang, Z.: Optimizing adaptive synchronization in parallel simulators for large-scale parallel systems and applications. In: CIT, pp. 131\u2013138. IEEE Computer Society, Los Alamitos (2010)"},{"key":"29_CR30","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/1772954.1772985","volume-title":"CGO","author":"H. Yu","year":"2010","unstructured":"Yu, H., Xue, J., Huo, W., Feng, X., Zhang, Z.: Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code. In: Moshovos, A., Steffan, J.G., Hazelwood, K.M., Kaeli, D.R. (eds.) CGO, pp. 218\u2013229. ACM, New York (2010)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21934-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T17:15:41Z","timestamp":1712510141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21934-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219337","9783642219344"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21934-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}