{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T16:40:33Z","timestamp":1743525633391,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311369"},{"type":"electronic","value":"9783642311376"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-31137-6_45","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T09:17:55Z","timestamp":1340011075000},"page":"592-606","source":"Crossref","is-referenced-by-count":3,"title":["Heap Slicing Using Type Systems"],"prefix":"10.1007","author":[{"given":"Mohamed A.","family":"El-Zawawy","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"11-13","key":"45_CR1","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1016\/j.tcs.2009.10.025","volume":"411","author":"R.W. Barraclough","year":"2010","unstructured":"Barraclough, R.W., Binkley, D., Danicic, S., Harman, M., Hierons, R.M., Kiss, \u00c1., Laurence, M., Ouarbya, L.: A trajectory-based strict semantics for program slicing. Theor. Comput. Sci.\u00a0411(11-13), 1372\u20131386 (2010)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Carrillo, S., Siegel, J., Li, X.: A control-structure splitting optimization for gpgpu. In: Johnson, G., Trinitis, C., Gaydadjiev, G., Veidenbaum, A.V. (eds.) Conf. Computing Frontiers, pp. 147\u2013150. ACM (2009)","key":"45_CR2","DOI":"10.1145\/1531743.1531766"},{"issue":"1","key":"45_CR3","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.asoc.2009.12.012","volume":"11","author":"C.-L. Chen","year":"2011","unstructured":"Chen, C.-L., Lin, S.-H.: Formulating and solving a class of optimization problems for high-performance gray world automatic white balance. Appl. Soft Comput.\u00a011(1), 523\u2013533 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"45_CR4","first-page":"22","volume":"30","author":"J. Cheney","year":"2007","unstructured":"Cheney, J.: Program slicing and data provenance. IEEE Data Eng. Bull.\u00a030(4), 22\u201328 (2007)","journal-title":"IEEE Data Eng. Bull."},{"doi-asserted-by":"crossref","unstructured":"Chilimbi, T.M., Davidson, B., Larus, J.R.: Cache-conscious structure definition. In: PLDI, pp. 13\u201324 (1999)","key":"45_CR5","DOI":"10.1145\/301631.301635"},{"key":"45_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-31985-6_12","volume-title":"Compiler Construction","author":"J. Condit","year":"2005","unstructured":"Condit, J., Necula, G.C.: Data Slicing: Separating the Heap into Independent Regions. In: Bodik, R. (ed.) CC 2005. LNCS, vol.\u00a03443, pp. 172\u2013187. Springer, Heidelberg (2005)"},{"issue":"6","key":"45_CR7","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1017\/S0956796801004282","volume":"12","author":"K. Crary","year":"2002","unstructured":"Crary, K., Weirich, S., Gregory Morrisett, J.: Intensional polymorphism in type-erasure semantics. J. Funct. Program.\u00a012(6), 567\u2013600 (2002)","journal-title":"J. Funct. Program."},{"issue":"1","key":"45_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/314602.314604","volume":"21","author":"D. Duggan","year":"1999","unstructured":"Duggan, D.: Dynamic typing for distributed programming in polymorphic languages. ACM Trans. Program. Lang. Syst.\u00a021(1), 11\u201345 (1999)","journal-title":"ACM Trans. Program. Lang. Syst."},{"doi-asserted-by":"crossref","unstructured":"El-Zawawy, M., Daoud, N.: New error-recovery techniques for faulty-calls of functions. Computer and Information Science\u00a04(3) (May 2012)","key":"45_CR9","DOI":"10.5539\/cis.v5n3p67"},{"unstructured":"El-Zawawy, M.A.: Semantic spaces in Priestley form. PhD thesis, University of Birmingham, UK (January 2007)","key":"45_CR10"},{"key":"45_CR11","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)"},{"doi-asserted-by":"crossref","unstructured":"El-Zawawy, M.A.: Probabilistic pointer analysis for multithreaded programs. ScienceAsia\u00a037(4) (December 2011)","key":"45_CR12","DOI":"10.2306\/scienceasia1513-1874.2011.37.344"},{"unstructured":"El-Zawawy, M.A.: Program optimization based pointer analysis and live stack-heap analysis. International Journal of Computer Science Issues 8(2) (March 2011)","key":"45_CR13"},{"doi-asserted-by":"crossref","unstructured":"El-Zawawy, M.A.: Dead code elimination based pointer analysis for multithreaded programs. Journal of the Egyptian Mathematical Society (January 2012), doi:10.1016\/j.joems.2011.12.011","key":"45_CR14","DOI":"10.1016\/j.joems.2011.12.011"},{"key":"45_CR15","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."},{"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) (October 2011)","key":"45_CR16"},{"doi-asserted-by":"crossref","unstructured":"Harper, R., Gregory Morrisett, J.: Compiling polymorphism using intensional type analysis. In: POPL, pp. 130\u2013141 (1995)","key":"45_CR17","DOI":"10.21236\/ADA285340"},{"key":"45_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-13792-1_5","volume-title":"Product-Focused Software Process Improvement","author":"R. Gaikovina Kula","year":"2010","unstructured":"Gaikovina Kula, R., Fushida, K., Kawaguchi, S., Iida, H.: Analysis of Bug Fixing Processes Using Program Slicing Metrics. In: Ali Babar, M., Vierimaa, M., Oivo, M. (eds.) PROFES 2010. LNCS, vol.\u00a06156, pp. 32\u201346. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"George, C.: Proof-carrying code. In: Henk, C., van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, 2nd edn., pp. 984\u2013986. Springer (2011)","key":"45_CR19","DOI":"10.1007\/978-1-4419-5906-5_864"},{"doi-asserted-by":"crossref","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.L.: Principles of Program Analysis. Springer (1999); second printing (2005)","key":"45_CR20","DOI":"10.1007\/978-3-662-03811-6"},{"unstructured":"Pettie, S.: Splay trees, davenport-schinzel sequences, and the deque conjecture. In: Teng, S.-H. (ed.) SODA, pp. 1115\u20131124. SIAM (2008)","key":"45_CR21"},{"key":"45_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-25379-9_4","volume-title":"Certified Programs and Proofs","author":"F. Pfenning","year":"2011","unstructured":"Pfenning, F., Caires, L., Toninho, B.: Proof-Carrying Code in a Session-Typed Process Calculus. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol.\u00a07086, pp. 21\u201336. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Prasad, S., Arun-Kumar, S.: Introduction to operational semantics. In: The Compiler Design Handbook, pp. 841\u2013890 (2002)","key":"45_CR23","DOI":"10.1201\/9781420040579.ch22"},{"doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Symposium on Logic in Computer Science, p. 55 (2002)","key":"45_CR24","DOI":"10.1109\/LICS.2002.1029817"},{"doi-asserted-by":"crossref","unstructured":"Sasirekha, N., Edwin Robert, A., Hemalatha, M.: Program slicing techniques and its applications. CoRR, abs\/1108.1352 (2011)","key":"45_CR25","DOI":"10.5121\/ijsea.2011.2304"},{"unstructured":"Tip, F.: A survey of program slicing techniques. J. Prog. Lang.\u00a03(3) (1995)","key":"45_CR26"},{"issue":"4","key":"45_CR27","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","volume":"10","author":"M. Weiser","year":"1984","unstructured":"Weiser, M.: Program slicing. IEEE Trans. Software Eng.\u00a010(4), 352\u2013357 (1984)","journal-title":"IEEE Trans. Software Eng."},{"doi-asserted-by":"crossref","unstructured":"Xin, B., Zhang, X.: Memory slicing. In: Rothermel, G., Dillon, L.K. (eds.) ISSTA, pp. 165\u2013176. ACM (2009)","key":"45_CR28","DOI":"10.1145\/1572272.1572292"},{"doi-asserted-by":"crossref","unstructured":"Ye, X., Li, P.: Parallel program performance modeling for runtime optimization of multi-algorithm circuit simulation. In: Sapatnekar, S.S. (ed.) DAC, pp. 561\u2013566. ACM (2010)","key":"45_CR29","DOI":"10.1145\/1837274.1837413"},{"issue":"4","key":"45_CR30","first-page":"492","volume":"5","author":"S. Zhang","year":"2010","unstructured":"Zhang, S., Cui, Z., Gong, S.-R., Liu, Q., Fan, J.-X.: A data aggregation algorithm based on splay tree for wireless sensor networks. JCP\u00a05(4), 492\u2013499 (2010)","journal-title":"JCP"},{"issue":"4","key":"45_CR31","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/1075382.1075384","volume":"27","author":"X. Zhang","year":"2005","unstructured":"Zhang, X., Gupta, R., Zhang, Y.: Cost and precision tradeoffs of dynamic data slicing algorithms. ACM Trans. Program. Lang. Syst.\u00a027(4), 631\u2013661 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2012"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31137-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T16:17:33Z","timestamp":1743524253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31137-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311369","9783642311376"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31137-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}