{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:15:27Z","timestamp":1725732927486},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396458"},{"type":"electronic","value":"9783642396465"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39646-5_7","type":"book-chapter","created":{"date-parts":[[2013,6,21]],"date-time":"2013-06-21T05:20:18Z","timestamp":1371792018000},"page":"82-97","source":"Crossref","is-referenced-by-count":2,"title":["Frequent Statement and De-reference Elimination for Distributed Programs"],"prefix":"10.1007","author":[{"given":"Mohamed A.","family":"El-Zawawy","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1049\/iet-sen.2010.0141","volume":"5","author":"S.S. Barpanda","year":"2011","unstructured":"Barpanda, S.S., Mohapatra, D.P.: Dynamic slicing of distributed object-oriented programs. IET Software\u00a05(5), 425\u2013433 (2011)","journal-title":"IET Software"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.parco.2010.09.002","volume":"37","author":"Y.-C. Chiu","year":"2011","unstructured":"Chiu, Y.-C., Shieh, C.-K., Huang, T.-C., Liang, T.-Y., Chu, K.-C.: Data race avoidance and replay scheme for developing and debugging parallel programs on distributed shared memory systems. Parallel Computing\u00a037(1), 11\u201325 (2011)","journal-title":"Parallel Computing"},{"key":"7_CR3","unstructured":"El-Zawawy, M.A.: Semantic spaces in Priestley form. PhD thesis, University of Birmingham, UK (January 2007)"},{"key":"7_CR4","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":"7_CR5","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":"7_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":"7_CR7","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":"7_CR8","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":"7_CR9","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":"7_CR10","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) (September 2012)","DOI":"10.1016\/j.joems.2012.08.009"},{"key":"7_CR11","series-title":"LNCS","first-page":"523","volume-title":"ICCSA 2013, Part V","author":"M.A. El-Zawawy","year":"2013","unstructured":"El-Zawawy, M.A.: Detection of probabilistic dangling references in multi-core programs using proof-supported tools. In: Murgante, B., et al. (eds.) ICCSA 2013, Part V. LNCS, vol.\u00a07975, pp. 523\u2013538. Springer, Heidelberg (2013)"},{"issue":"5","key":"7_CR12","first-page":"14","volume":"12","author":"M.A. El-Zawawy","year":"2012","unstructured":"El-Zawawy, M.A., Daoud, N.M.: 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":"7_CR13","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":"7_CR14","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":"7_CR15","first-page":"127","volume":"11","author":"M.A. El-Zawawy","year":"2011","unstructured":"El-Zawawy, M.A., Nayel, H.A.: Partial 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":"7_CR16","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":"7_CR17","doi-asserted-by":"crossref","unstructured":"Gopalakrishnan, S., Kalla, P.: Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis. In: DATE, pp. 1452\u20131457. IEEE (2009)","DOI":"10.1109\/DATE.2009.5090892"},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s11265-010-0458-9","volume":"61","author":"H. Ho","year":"2010","unstructured":"Ho, H., Szwarc, V., Kwasniewski, T.A.: Low complexity reconfigurable dsp circuit implementations based on common sub-expression elimination. Signal Processing Systems\u00a061(3), 353\u2013365 (2010)","journal-title":"Signal Processing Systems"},{"issue":"10","key":"7_CR19","doi-asserted-by":"publisher","first-page":"2012","DOI":"10.1109\/TCAD.2006.875712","volume":"25","author":"A. Hosangadi","year":"2006","unstructured":"Hosangadi, A., Fallah, F., Kastner, R.: Optimizing polynomial expressions by algebraic factorization and common subexpression elimination. IEEE Trans. on CAD of Integrated Circuits and Systems\u00a025(10), 2012\u20132022 (2006)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Seragiotto Jr., C.: Thomas Fahringer. Performance analysis for distributed and parallel java programs with aksum. In: CCGRID, pp. 1024\u20131031. IEEE Computer Society (2005)","DOI":"10.1109\/CCGRID.2005.1558673"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-74061-2_18","volume-title":"Static Analysis","author":"A. Kamil","year":"2007","unstructured":"Kamil, A., Yelick, K.A.: Hierarchical pointer analysis for distributed programs. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 281\u2013297. Springer, Heidelberg (2007)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Liblit, B., Aiken, A.: Type systems for distributed data structures. In: POPL, pp. 199\u2013213 (2000)","DOI":"10.21236\/ADA603881"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3-540-44898-5_15","volume-title":"Static Analysis","author":"B. Liblit","year":"2003","unstructured":"Liblit, B., Aiken, A., Yelick, K.A.: Type systems for distributed data sharing. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 273\u2013294. Springer, Heidelberg (2003)"},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s11227-010-0439-6","volume":"59","author":"P. Lindberg","year":"2012","unstructured":"Lindberg, P., Leingang, J., Lysaker, D., Khan, S.U., Li, J.: Comparison and analysis of eight scheduling heuristics for the optimization of energy consumption and makespan in large-scale distributed systems. The Journal of Supercomputing\u00a059(1), 323\u2013360 (2012)","journal-title":"The Journal of Supercomputing"},{"key":"7_CR25","unstructured":"Nicolau, A., Dutt, N.D., Gupta, R., Savoiu, N., Reshadi, M., Gupta, S.: Dynamic common sub-expression elimination during scheduling in high-level synthesis. In: ISSS, pp. 261\u2013266. IEEE Computer Society (2002)"},{"issue":"2","key":"7_CR26","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.cmpb.2011.05.006","volume":"104","author":"T.U. Onbay","year":"2011","unstructured":"Onbay, T.U., Kantarci, A.: Design and implementation of a distributed teleradiaography system: Dipacs. Computer Methods and Programs in Biomedicine\u00a0104(2), 235\u2013242 (2011)","journal-title":"Computer Methods and Programs in Biomedicine"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Saabas, A., Uustalu, T.: Program and proof optimizations with type systems. Journal of Logic and Algebraic Programming\u00a077(1-2), 131\u2013154 (2008); The 16th Nordic Workshop on the Prgramming Theory (NWPT 2006)","DOI":"10.1016\/j.jlap.2008.05.007"},{"issue":"2","key":"7_CR28","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1155\/2006\/763568","volume":"14","author":"S. Simmons","year":"2006","unstructured":"Simmons, S., Edwards, D., Kearns, P.: Communication analysis of distributed programs. Scientific Programming\u00a014(2), 151\u2013170 (2006)","journal-title":"Scientific Programming"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Toporkov, V.V.: Dataflow analysis of distributed programs using generalized marked nets. In: DepCoS-RELCOMEX, pp. 73\u201380. IEEE Computer Society (2007)","DOI":"10.1109\/DEPCOS-RELCOMEX.2007.14"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11549468_9","volume-title":"Euro-Par 2005 Parallel Processing","author":"H.L. Truong","year":"2005","unstructured":"Truong, H.L., Fahringer, T.: Soft computing approach to performance analysis of parallel and distributed programs. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol.\u00a03648, pp. 50\u201360. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39646-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T09:00:39Z","timestamp":1557824439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39646-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396458","9783642396465"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39646-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}