{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:11:38Z","timestamp":1743135098781,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396397"},{"type":"electronic","value":"9783642396403"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39640-3_38","type":"book-chapter","created":{"date-parts":[[2013,6,21]],"date-time":"2013-06-21T02:25:58Z","timestamp":1371781558000},"page":"516-530","source":"Crossref","is-referenced-by-count":2,"title":["Detection of Probabilistic Dangling References in Multi-core Programs Using Proof-Supported Tools"],"prefix":"10.1007","author":[{"given":"Mohamed A.","family":"El-Zawawy","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.jss.2009.11.705","volume":"83","author":"F. Ahmad","year":"2010","unstructured":"Ahmad, F., Huang, H., Wang, X.-L.: Petri net modeling and deadlock analysis of parallel manufacturing processes with shared-resources. J. Syst. Softw.\u00a083, 675\u2013688 (2010)","journal-title":"J. Syst. Softw."},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/11909033_2","volume-title":"Communications and Multimedia Security","author":"S. Antonatos","year":"2006","unstructured":"Antonatos, S., Anagnostakis, K.G.: TAO: Protecting against hitlist worms using transparent address obfuscation. In: Leitold, H., Markatos, E.P. (eds.) CMS 2006. LNCS, vol.\u00a04237, pp. 12\u201321. Springer, Heidelberg (2006)"},{"key":"38_CR3","doi-asserted-by":"crossref","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 (2004)","DOI":"10.1145\/982962.964003"},{"key":"38_CR4","first-page":"17","volume-title":"Proceedings of the 14th Conference on USENIX Security Symposium","author":"S. Bhatkar","year":"2005","unstructured":"Bhatkar, S., Sekar, R., DuVarney, D.C.: Efficient techniques for comprehensive protection from memory error exploits. In: Proceedings of the 14th Conference on USENIX Security Symposium, vol.\u00a014, p. 17. USENIX Association, Berkeley (2005)"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/989393.989412","volume":"39","author":"D. Callahan","year":"2004","unstructured":"Callahan, D., Cooper, K.D., Kennedy, K., Torczon, L.: Interprocedural constant propagation. SIGPLAN Not.\u00a039, 155\u2013166 (2004)","journal-title":"SIGPLAN Not."},{"issue":"3","key":"38_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TC.2010.126","volume":"60","author":"Y.-H. Chang","year":"2011","unstructured":"Chang, Y.-H., Kuo, T.-W.: A management strategy for the reliability and performance improvement of mlc-based flash-memory storage systems. IEEE Trans. Computers\u00a060(3), 305\u2013320 (2011)","journal-title":"IEEE Trans. Computers"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44905-1_18","volume-title":"Languages and Compilers for Parallel Computing","author":"J.-F. Collard","year":"2000","unstructured":"Collard, J.-F., Griebl, M.: A precise fixpoint reaching definition analysis for arrays. In: Carter, L., Ferrante, J. (eds.) LCPC 1999. LNCS, vol.\u00a01863, Springer, Heidelberg (2000)"},{"key":"38_CR8","unstructured":"El-Zawawy, M.A.: Semantic spaces in Priestley form. PhD thesis, University of Birmingham, UK (January 2007)"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-21934-4_29","volume-title":"Computational Science and Its Applications - ICCSA 2011","author":"M.A. El-Zawawy","year":"2011","unstructured":"El-Zawawy, M.A.: Flow sensitive-insensitive pointer analysis based memory safety for multithreaded programs. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011, Part V. LNCS, vol.\u00a06786, pp. 355\u2013369. Springer, Heidelberg (2011)"},{"issue":"4","key":"38_CR10","doi-asserted-by":"publisher","first-page":"344","DOI":"10.2306\/scienceasia1513-1874.2011.37.344","volume":"37","author":"M.A. El-Zawawy","year":"2011","unstructured":"El-Zawawy, M.A.: Probabilistic pointer analysis for multithreaded programs. ScienceAsia\u00a037(4), 344\u2013354 (2011)","journal-title":"ScienceAsia"},{"issue":"2","key":"38_CR11","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":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-31128-4_7","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2012","author":"M.A. El-Zawawy","year":"2012","unstructured":"El-Zawawy, M.A.: Abstraction analysis and certified flow and context sensitive points-to relation for distributed programs. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part IV. LNCS, vol.\u00a07336, pp. 83\u201399. Springer, Heidelberg (2012)"},{"issue":"1","key":"38_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.joems.2011.12.011","volume":"20","author":"M.A. El-Zawawy","year":"2012","unstructured":"El-Zawawy, M.A.: Dead code elimination based pointer analysis for multithreaded programs. Journal of the Egyptian Mathematical Society\u00a020(1), 28\u201337 (2012)","journal-title":"Journal of the Egyptian Mathematical Society"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-642-31137-6_45","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2012","author":"M.A. El-Zawawy","year":"2012","unstructured":"El-Zawawy, M.A.: Heap slicing using type systems. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part III. LNCS, vol.\u00a07335, pp. 592\u2013606. Springer, Heidelberg (2012)"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"El-Zawawy, M.A.: Recognition of logically related regions based heap abstraction. Journal of the Egyptian Mathematical Society\u00a020(2) (2012)","DOI":"10.1016\/j.joems.2012.08.009"},{"key":"38_CR16","series-title":"LNCS","first-page":"82","volume-title":"ICCSA 2013","author":"M.A. El-Zawawy","year":"2013","unstructured":"El-Zawawy, M.A.: Frequent statement and de-reference elimination for distributed programs. In: Murgante, B., Misra, S., Carlini, M., Torre, C.M., Quang, N.H., Taniar, D., Apduhan, B.O., Gervasi, O. (eds.) ICCSA 2013, Part III. LNCS, vol.\u00a07973, pp. 82\u201397. Springer, Heidelberg (2013)"},{"issue":"5","key":"38_CR17","first-page":"14","volume":"12","author":"M.A. El-Zawawy","year":"2012","unstructured":"El-Zawawy, M.A., Daoud, N.M.: M. Daoud. Dynamic verification for file safety of multithreaded programs. IJCSNS International Journal of Computer Science and Network Security\u00a012(5), 14\u201320 (2012)","journal-title":"IJCSNS International Journal of Computer Science and Network Security"},{"issue":"3","key":"38_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.5539\/cis.v5n3p67","volume":"5","author":"M.A. El-Zawawy","year":"2012","unstructured":"El-Zawawy, M.A., Daoud, N.M.: New error-recovery techniques for faulty-calls of functions. Computer and Information Science\u00a05(3), 67\u201375 (2012)","journal-title":"Computer and Information Science"},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.entcs.2006.04.011","volume":"158","author":"M.A. El-Zawawy","year":"2006","unstructured":"El-Zawawy, M.A., Jung, A.: Priestley duality for strong proximity lattices. Electr. Notes Theor. Comput. Sci.\u00a0158, 199\u2013217 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"10","key":"38_CR20","first-page":"127","volume":"11","author":"M.A. El-Zawawy","year":"2011","unstructured":"El-Zawawy, M.A., Partial, H.A.N.: redundancy elimination for multi-threaded programs. IJCSNS International Journal of Computer Science and Network Security\u00a011(10), 127\u2013133 (2011)","journal-title":"IJCSNS International Journal of Computer Science and Network Security"},{"issue":"4","key":"38_CR21","first-page":"53","volume":"5","author":"M.A. El-Zawawy","year":"2012","unstructured":"El-Zawawy, M.A., Nayel, H.A.: Type systems based data race detector. IJCSNS International Journal of Computer Science and Network Security\u00a05(4), 53\u201360 (2012)","journal-title":"IJCSNS International Journal of Computer Science and Network Security"},{"key":"38_CR22","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1145\/1075382.1075385","volume":"27","author":"M.W. Hall","year":"2005","unstructured":"Hall, M.W., Amarasinghe, S.P., Murphy, B.R., Liao, S.-W., Lam, M.S.: Interprocedural parallelization analysis in suif. ACM Trans. Program. Lang. Syst.\u00a027, 662\u2013731 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"38_CR23","doi-asserted-by":"crossref","unstructured":"Hauswirth, M., Chilimbi, T.M.: Low-overhead memory leak detection using adaptive statistical profiling. In: Mukherjee, S., McKinley, K.S. (eds.) ASPLOS, pp. 156\u2013164. ACM (2004)","DOI":"10.1145\/1037187.1024412"},{"key":"38_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/3-540-48387-X_46","volume-title":"Parallel Computing Technologies","author":"Y.-C. Kim","year":"1999","unstructured":"Kim, Y.-C., Jun, Y.-K.: Restructuring parallel programs for on-the-fly race detection. In: Malyshkin, V.E. (ed.) PaCT 1999. LNCS, vol.\u00a01662, pp. 446\u2013451. Springer, Heidelberg (1999)"},{"key":"38_CR25","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1145\/989393.989439","volume":"39","author":"J. Knoop","year":"2004","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Lazy code motion. SIGPLAN Not\u00a039, 460\u2013472 (2004)","journal-title":"SIGPLAN Not"},{"key":"38_CR26","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/229542.229545","volume":"18","author":"J. Knoop","year":"1996","unstructured":"Knoop, J., Steffen, B., Vollmer, J.: Parallelism for free: efficient and optimal bitvector analyses for parallel programs. ACM Trans. Program. Lang. Syst.\u00a018, 268\u2013299 (1996)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"38_CR27","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1016\/j.jss.2010.07.027","volume":"83","author":"W.B. Langdon","year":"2010","unstructured":"Langdon, W.B., Harman, M., Jia, Y.: Efficient multi-objective higher order mutation testing with genetic programming. J. Syst. Softw.\u00a083, 2416\u20132430 (2010)","journal-title":"J. Syst. Softw."},{"key":"38_CR28","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)"},{"key":"38_CR29","doi-asserted-by":"crossref","unstructured":"Novark, G., Berger, E.D.: Dieharder: securing the heap. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM Conference on Computer and Communications Security, pp. 573\u2013584. ACM (2010)","DOI":"10.1145\/1866307.1866371"},{"key":"38_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/1409360.1409382","volume":"51","author":"G. Novark","year":"2008","unstructured":"Novark, G., Berger, E.D., Zorn, B.G.: Exterminator: Automatically correcting memory errors with high probability. Commun. ACM\u00a051, 87\u201395 (2008)","journal-title":"Commun. ACM"},{"key":"38_CR31","unstructured":"Robertson, W.K., Kr\u00fcgel, C., Mutz, D., Valeur, F.: Run-time detection of heap-based overflows. In: LISA, pp. 51\u201360. USENIX (2003)"},{"issue":"1","key":"38_CR32","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s10458-010-9130-9","volume":"23","author":"S. Sardi\u00f1a","year":"2011","unstructured":"Sardi\u00f1a, S., Padgham, L.: A bdi agent programming language with failure handling, declarative goals, and planning. Autonomous Agents and Multi-Agent Systems\u00a023(1), 18\u201370 (2011)","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"38_CR33","first-page":"298","volume-title":"Proceedings of the 11th ACM Conference on Computer and Communications Security , CCS 2004","author":"H. Shacham","year":"2004","unstructured":"Shacham, H., Page, M., Pfaff, B., Goh, E.-J., Modadugu, N., Boneh, D.: On the effectiveness of address-space randomization. In: Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS 2004, pp. 298\u2013307. ACM, New York (2004)"},{"key":"38_CR34","doi-asserted-by":"crossref","unstructured":"Da Silva, J., Steffan, J.G.: A probabilistic pointer analysis for speculative optimizations. In: Shen, J.P., Martonosi, M. (eds.) ASPLOS, pp. 416\u2013425. ACM (2006)","DOI":"10.1145\/1168918.1168908"},{"key":"38_CR35","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/158511.158644","volume-title":"Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1993","author":"H. Srinivasan","year":"1993","unstructured":"Srinivasan, H., Hook, J., Wolfe, M.: Static single assignment for explicitly parallel programs. In: Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1993, pp. 260\u2013272. ACM, New York (1993)"},{"key":"38_CR36","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/641865.641867","volume":"35","author":"T. Ungerer","year":"2003","unstructured":"Ungerer, T., Robi\u010d, B., \u0160ilc, J.: A survey of processors with explicit multithreading. ACM Comput. Surv.\u00a035, 29\u201363 (2003)","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39640-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T02:58:56Z","timestamp":1675220336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39640-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396397","9783642396403"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39640-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}