{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:06:37Z","timestamp":1725505597730},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787907"},{"type":"electronic","value":"9783540787914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78791-4_17","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:13:15Z","timestamp":1207091595000},"page":"245-259","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models"],"prefix":"10.1007","author":[{"given":"Mark","family":"Marron","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]},{"given":"Deepak","family":"Kapur","sequence":"additional","affiliation":[]},{"given":"Darko","family":"Stefanovic","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-73368-3_22","volume-title":"Computer Aided Verification","author":"J. Berdine","year":"2007","unstructured":"Berdine, J., Calcagno, C., Cook, B., Distefano, D., O\u2019Hearn, P., Wies, T., Yang, H.: Shape analysis for composite data structures. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 178\u2013192. Springer, Heidelberg (2007)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M.: A Practical Framework for the Abstract Interpretation of Logic Programs. J. Log. Program\u00a010, 91\u2013124 (1991)","journal-title":"J. Log. Program"},{"key":"17_CR3","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":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/3-540-44898-5_26","volume-title":"Static Analysis","author":"S. Chong","year":"2003","unstructured":"Chong, S., Rugina, R.: Static analysis of accessed regions in recursive data structures. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 463\u2013482. Springer, Heidelberg (2003)"},{"key":"17_CR5","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":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","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 data structures. In: Koskimies, K. (ed.) CC 1998. LNCS, vol.\u00a01383, pp. 159\u2013173. Springer, Heidelberg (1998)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/11823230_16","volume-title":"Static Analysis","author":"A. Gotsman","year":"2006","unstructured":"Gotsman, A., Berdine, J., Cook, B.: Interprocedural shape analysis with separated heap abstractions. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 240\u2013260. Springer, Heidelberg (2006)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-73368-3_42","volume-title":"Computer Aided Verification","author":"S. Gulwani","year":"2007","unstructured":"Gulwani, S., Tiwari, A.: An abstract domain for analyzing heap-manipulating low-level software. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 379\u2013392. Springer, Heidelberg (2007)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Guo, B., Vachharajani, N., August, D.: Shape analysis with inductive recursion synthesis. In: PLDI (2007)","DOI":"10.1145\/1250734.1250764"},{"key":"17_CR10","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":"17_CR11","doi-asserted-by":"crossref","unstructured":"Ishtiaq, S.S., O\u2019Hearn, P.W.: BI as an assertion language for mutable data structures. In: POPL (2001)","DOI":"10.1145\/360204.375719"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-27864-1_19","volume-title":"Static Analysis","author":"B. Jeannet","year":"2004","unstructured":"Jeannet, B., Loginov, A., Reps, T.W., Sagiv, S.: A relational approach to interprocedural shape analysis. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 246\u2013264. Springer, Heidelberg (2004)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-3-540-27864-1_20","volume-title":"Static Analysis","author":"R. Manevich","year":"2004","unstructured":"Manevich, R., Sagiv, S., Ramalingam, G., Field, J.: Partially disjunctive heap abstraction. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 265\u2013279. Springer, Heidelberg (2004)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-540-72521-3_25","volume-title":"Languages and Compilers for Parallel Computing","author":"M. Marron","year":"2007","unstructured":"Marron, M., Kapur, D., Stefanovic, D., Hermenegildo, M.: A static heap analysis for shape and connectivity. In: Alm\u00e1si, G.S., Ca\u015fcaval, C., Wu, P. (eds.) KSEM 2006. LNCS, vol.\u00a04382, pp. 345\u2013363. Springer, Heidelberg (2007)"},{"key":"17_CR15","unstructured":"Marron, M., Majumdar, R., Stefanovic, D., Kapur, D.: Dominance: Modeling heap structures with sharing. Tech. report, CS Dept., Univ. of New Mexico (August 2007)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: POPL (2004)","DOI":"10.1145\/964001.964029"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Muthukumar, K., Hermenegildo, M.V.: Compile-time derivation of variable dependency using abstract interpretation. J. Log. Program (1992)","DOI":"10.1016\/0743-1066(92)90035-2"},{"key":"17_CR18","unstructured":"Modified Jolden Benchmarks (August 2007), http:\/\/www.cs.unm.edu\/~marron"},{"key":"17_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"key":"17_CR20","unstructured":"Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: LICS (2002)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Rinetzky, N., Bauer, J., Reps, T.W., Sagiv, S., Wilhelm, R.: A semantics for procedure local heaps and its abstractions. In: POPL (2005)","DOI":"10.1145\/1040305.1040330"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45306-7_10","volume-title":"Compiler Construction","author":"N. Rinetzky","year":"2001","unstructured":"Rinetzky, N., Sagiv, S.: Interprocedural shape analysis for recursive programs. In: Wilhelm, R. (ed.) CC 2001. LNCS, vol.\u00a02027, pp. 133\u2013149. Springer, Heidelberg (2001)"},{"key":"17_CR23","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":"17_CR24","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":"17_CR25","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":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/BFb0036946","volume-title":"Automata, Languages and Programming","author":"M.B. Smyth","year":"1983","unstructured":"Smyth, M.B.: Power domains and predicate transformers: A topological view. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 662\u2013675. Springer, Heidelberg (1983)"},{"key":"17_CR27","unstructured":"Standard Performance Evaluation Corporation. JVM98 Version 1.04 (August 1998), http:\/\/www.spec.org\/osg\/jvm98\/jvm98\/doc\/index.html"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46423-9_1","volume-title":"Compiler Construction","author":"R. Wilhelm","year":"2000","unstructured":"Wilhelm, R., Sagiv, S., Reps, T.W.: Shape analysis. In: Watt, D.A. (ed.) CC 2000. LNCS, vol.\u00a01781, pp. 1\u201317. Springer, Heidelberg (2000)"}],"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-78791-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:22:26Z","timestamp":1619522546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78791-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787907","9783540787914"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78791-4_17","relation":{},"subject":[]}}