{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:50:45Z","timestamp":1725511845807},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540712282"},{"type":"electronic","value":"9783540712299"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71229-9_13","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T17:39:13Z","timestamp":1183311553000},"page":"187-201","source":"Crossref","is-referenced-by-count":4,"title":["Layout Transformations for Heap Objects Using Static Access Patterns"],"prefix":"10.1007","author":[{"given":"Jinseong","family":"Jeon","sequence":"first","affiliation":[]},{"given":"Keoncheol","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Hwansoo","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Seidl, M.L., Zorn, B.G.: Segregating heap objects by reference behavior and lifetime. In: ASPLOS-VIII, Oct. 1998, pp. 12\u201323 (1998)","DOI":"10.1145\/291069.291012"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: Automatic pool allocation: improving performance by controlling data structure layout in the heap. In: PLDI \u201905, Jun. 2005, pp. 129\u2013142 (2005)","DOI":"10.1145\/1065010.1065027"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Cherem, S., Rugina, R.: Region analysis and transformation for java programs. In: ISMM \u201904: International Symposium on Memory Management, Oct. 2004, pp. 85\u201396 (2004)","DOI":"10.1145\/1029873.1029884"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Shen, X., et al.: Lightweight reference affinity analysis. In: ICS \u201905: International Conference on Supercomputing, pp. 131\u2013140 (2005)","DOI":"10.1145\/1088149.1088167"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Zhong, Y., et al.: Array regrouping and structure splitting using whole-program reference affinity. In: PLDI \u201904, pp. 255\u2013266 (2004)","DOI":"10.1145\/996841.996872"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Chilimbi, T.M., Davidson, B., Larus, J.R.: Cache-conscious structure definition. In: PLDI \u201999, May 1999, pp. 13\u201324 (1999)","DOI":"10.1145\/301618.301635"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1145\/643470.643474","volume":"2","author":"R.M. Rabbah","year":"2003","unstructured":"Rabbah, R.M., Palem, K.V.: Data remapping for design space optimization of embedded memory systems. ACM TECS\u00a02(2), 186\u2013218 (2003)","journal-title":"ACM TECS"},{"key":"13_CR8","unstructured":"Shin, K., et al.: Restructuring field layouts for embedded memory systems. In: DATE \u201906: Design, Automation and Test in Europe, Mar. 2006, pp. 937\u2013942 (2006)"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1145\/291891.291894","volume":"20","author":"M. Tofte","year":"1998","unstructured":"Tofte, M., Birkedal, L.: A region inference algorithm. ACM TOPLAS\u00a020(4), 724\u2013767 (1998)","journal-title":"ACM TOPLAS"},{"key":"13_CR10","volume-title":"Introduction to automata theory, languages, and computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation, 2nd edn. Addison-Wesley, Reading (2001)","edition":"2"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/322261.322272","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: A unified approach to path problems. J. ACM\u00a028(3), 577\u2013593 (1981)","journal-title":"J. ACM"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: Fast algorithms for solving path problems. J. ACM\u00a028(3), 594\u2013614 (1981)","journal-title":"J. ACM"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: FMPA \u201993: Formal Methods in Programming and their Applications, pp. 128\u2013141 (1993)","DOI":"10.1007\/BFb0039704"},{"issue":"5","key":"13_CR14","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1145\/330249.330254","volume":"21","author":"N. Gloy","year":"1999","unstructured":"Gloy, N., Smith, M.D.: Procedure placement using temporal-ordering information. ACM TOPLAS\u00a021(5), 977\u20131027 (1999)","journal-title":"ACM TOPLAS"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-45937-5_16","volume-title":"Compiler Construction","author":"G.C. Necula","year":"2002","unstructured":"Necula, G.C., et al.: CIL: Intermediate language and tools for analysis and transformation of c programs. In: Horspool, R.N. (ed.) CC 2002 and ETAPS 2002. LNCS, vol.\u00a02304, pp. 213\u2013228. Springer, Heidelberg (2002)"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/201059.201065","volume":"17","author":"A. Rogers","year":"1995","unstructured":"Rogers, A., et al.: Supporting dynamic data structures on distributed-memory machines. ACM TOPLAS\u00a017(2), 233\u2013263 (1995)","journal-title":"ACM TOPLAS"},{"key":"13_CR17","unstructured":"Valgrind, \n                    \n                      http:\/\/valgrind.org\/"},{"key":"13_CR18","unstructured":"McGill benchmark suite, \n                    \n                      http:\/\/llvm.org\/"},{"issue":"6","key":"13_CR19","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/773473.178446","volume":"29","author":"T.M. Austin","year":"1994","unstructured":"Austin, T.M., Breach, S.E., Sohi, G.S.: Efficient detection of all pointer and array access errors. ACM SIGPLAN Notices\u00a029(6), 290\u2013301 (1994)","journal-title":"ACM SIGPLAN Notices"},{"key":"13_CR20","unstructured":"Wheeler, D.A.: SLOCcount, \n                    \n                      http:\/\/www.dwheeler.com\/sloccount\/"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Guyer, S.Z., McKinley, K.S.: Finding your cronies: static analysis for dynamic object colocation. In: OOPSLA \u201904, pp. 237\u2013250 (2004)","DOI":"10.1145\/1028976.1028996"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Huang, X., et al.: The garbage collection advantage: improving program locality. In: OOPSLA \u201904, pp. 69\u201380 (2004)","DOI":"10.1145\/1028976.1028983"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71229-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:17:05Z","timestamp":1605763025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71229-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540712282","9783540712299"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71229-9_13","relation":{},"subject":[]}}