{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:15Z","timestamp":1725512115581},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725206"},{"type":"electronic","value":"9783540725213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72521-3_25","type":"book-chapter","created":{"date-parts":[[2007,6,10]],"date-time":"2007-06-10T16:53:29Z","timestamp":1181494409000},"page":"345-363","source":"Crossref","is-referenced-by-count":2,"title":["A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework"],"prefix":"10.1007","author":[{"given":"Mark","family":"Marron","sequence":"first","affiliation":[]},{"given":"Deepak","family":"Kapur","sequence":"additional","affiliation":[]},{"given":"Darko","family":"Stefanovic","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Cahoon, B., McKinley, K.S.: Data flow analysis for software prefetching linked data structures in Java. In: PACT (2001)","DOI":"10.1109\/PACT.2001.953309"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Chase, D.R., Wegman, M.N., Zadeck, F.K.: Analysis of pointers and structures. In: PLDI (1990)","DOI":"10.1145\/93542.93585"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Deutsch, A.: Interprocedural may-alias analysis for pointers: Beyond k-limiting. In: PLDI (1994)","DOI":"10.1145\/178243.178263"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Ghiya, R., Hendren, L.J.: Is it a tree, a dag, or a cyclic graph? A shape analysis for heap-directed pointers in C. In: POPL (1996)","DOI":"10.1145\/237721.237724"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Ghiya, R., Hendren, L.J.: Putting pointer analysis to work. In: POPL (1998)","DOI":"10.1145\/268946.268957"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0026429","volume-title":"Compiler Construction","author":"R. Ghiya","year":"1998","unstructured":"Ghiya, R., Hendren, L.J., Zhu, Y.: Detecting parallelism in C programs with recursive darta structures. In: Koskimies, K. (ed.) CC 1998 and ETAPS 1998. LNCS, vol.\u00a01383, Springer, Heidelberg (1998)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Hackett, B., Rugina, R.: Region-based shape analysis with tracked locations. In: POPL (2005)","DOI":"10.1145\/1040305.1040331"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Hendren, L.J., Nicolau, A.: Parallelizing programs with recursive data structures. IEEE TPDS\u00a01(1) (1990)","DOI":"10.1109\/71.80123"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Jones, N.D., Muchnick, S.S.: Flow analysis and optimization of lisp-like structures. In: POPL (1979)","DOI":"10.1145\/567752.567776"},{"key":"25_CR10","unstructured":"Lattner, C., Adve, V.: Data Structure Analysis: An Efficient Context-Sensitive Heap Analysis. Tech. Report UIUCDCS-R-2003-2340, Computer Science Dept., Univ. of Illinois at Urbana-Champaign (Apr. 2003)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In: CGO (2004)","DOI":"10.1109\/CGO.2004.1281665"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Static Analysis","author":"T. Lev-Ami","year":"2000","unstructured":"Lev-Ami, T., Sagiv, S.: TVLA: A system for implementing static analyses. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol.\u00a01824, Springer, Heidelberg (2000)"},{"key":"25_CR13","unstructured":"Marron, M., Kapur, D., Stefanovic, D., Hermenegildo, M.: Unified memory analysis. Tech. Rep. TR-CS-2006-06, University of New Mexico (Apr. 2006), Available at http:\/\/www.cs.unm.edu\/~treport\/tr\/06-04\/uma.pdf"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11547662_20","volume-title":"Static Analysis","author":"N. Rinetzky","year":"2005","unstructured":"Rinetzky, N., Sagiv, M., Yahav, E.: Interprocedural shape analysis for cutpoint-free programs. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, Springer, Heidelberg (2005)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Rugina, R., Rinard, M.C.: Automatic parallelization of divide and conquer algorithms. In: PPOPP (1999)","DOI":"10.1145\/301104.301111"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Sagiv, S., Reps, T.W., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. In: POPL (1996)","DOI":"10.1145\/237721.237725"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. In: POPL (1999)","DOI":"10.1145\/292540.292552"},{"key":"25_CR18","unstructured":"Vall\u00e9e-Rai, R., et al.: Soot - a Java optimization framework. In: CASCON (1999), www.sable.mcgill.ca\/publications"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Wilson, R.P., Lam, M.S.: Efficient context-sensitive pointer analysis for C programs. In: PLDI (1995)","DOI":"10.1145\/207110.207111"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Yahav, E., Ramalingam, G.: Verifying safety properties using separation and heterogeneous abstractions. In: PLDI (2004)","DOI":"10.1145\/996841.996846"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72521-3_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:34:16Z","timestamp":1605764056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72521-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725206","9783540725213"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72521-3_25","relation":{},"subject":[]}}