{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:50:54Z","timestamp":1725670254745},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642286513"},{"type":"electronic","value":"9783642286520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28652-0_3","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T17:02:02Z","timestamp":1332435722000},"page":"41-60","source":"Crossref","is-referenced-by-count":0,"title":["Programming Paradigm Driven Heap Analysis"],"prefix":"10.1007","author":[{"given":"Mark","family":"Marron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Lhot\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anindya","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Barr, E., Bird, C., Marron, M.: Collecting a Heap of Shapes. Technical Report MSR-TR-2011-135, Microsoft Research (December 2011)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P., Yang, H.: Compositional shape analysis by means of bi-abduction. J. ACM (2011)","DOI":"10.1145\/2049697.2049700"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Chase, D., Wegman, M., Zadeck, K.: Analysis of pointers and structures. In: PLDI (1990)","DOI":"10.1145\/93542.93585"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Dillig, I., Dillig, T., Aiken, A., Sagiv, M.: Precise and compact modular procedure summaries for heap manipulating programs. In: PLDI (2011)","DOI":"10.1145\/1993498.1993565"},{"key":"3_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":"3_CR6","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":"3_CR7","doi-asserted-by":"crossref","unstructured":"Guyer, S.Z., McKinley, K.S.: Finding your cronies: static analysis for dynamic object colocation. In: OOPSLA (2004)","DOI":"10.1145\/1028976.1028996"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Guyer, S.Z., McKinley, K.S., Frampton, D.: Free-me: a static analysis for automatic individual object reclamation. In: PLDI (2006)","DOI":"10.1145\/1133981.1134024"},{"key":"3_CR9","unstructured":"Jolden Suite, \n                    \n                      http:\/\/www-ali.cs.umass.edu\/DaCapo\/"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Jones, N., Muchnick, S.: Flow analysis and optimization of Lisp-like structures. In: POPL (1979)","DOI":"10.1145\/567752.567776"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: Automatic pool allocation: improving performance by controlling data structure layout in the heap. In: PLDI (2005)","DOI":"10.1145\/1065010.1065027"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Lattner, C., Lenharth, A., Adve, V.: Making context-sensitive points-to analysis with heap cloning practical for the real world. In: PLDI (2007)","DOI":"10.1145\/1250734.1250766"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Lhot\u00e1k, O., Hendren, L.: Evaluating the benefits of context-sensitive points-to analysis using a BDD-based implementation. ACM Trans. Softw. Eng. Method. 18(1) (2008)","DOI":"10.1145\/1391984.1391987"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Ma, K.-K., Foster, J.: Inferring aliasing and encapsulation properties for Java. In: OOPSLA (2007)","DOI":"10.1145\/1297027.1297059"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, M., Ramalingam, G., Field, J.: Partially Disjunctive Heap Abstraction. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 265\u2013279. Springer, Heidelberg (2004)"},{"key":"3_CR16","unstructured":"Marron, M.: Structural analysis: Combining shape analysis information with points-to analysis computation. arXiv:1201.1277v1 [cs.PL] (2012)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-78791-4_17","volume-title":"Compiler Construction","author":"M. Marron","year":"2008","unstructured":"Marron, M., Hermenegildo, M., Kapur, D., Stefanovic, D.: Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models. In: Hendren, L. (ed.) CC 2008. LNCS, vol.\u00a04959, pp. 245\u2013259. Springer, Heidelberg (2008)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Marron, M., M\u00e9ndez-Lojo, M., Hermenegildo, M., Stefanovic, D., Kapur, D.: Sharing analysis of arrays, collections, and recursive structures. In: PASTE (2008)","DOI":"10.1145\/1512475.1512485"},{"key":"3_CR19","unstructured":"Marron, M., Sanchez, C., Su, Z., Fahndrich, M.: Abstracting runtime heaps for program understanding (2011), \n                    \n                      http:\/\/heapdbg.codeplex.com\/"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Marron, M., Stefanovic, D., Hermenegildo, M., Kapur, D.: Heap analysis in the presence of collection libraries. In: PASTE (2007)","DOI":"10.1145\/1251535.1251541"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-540-31987-0_2","volume-title":"Programming Languages and Systems","author":"L. Mauborgne","year":"2005","unstructured":"Mauborgne, L., Rival, X.: Trace Partitioning in Abstract Interpretation Based Static Analyzers. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 5\u201320. Springer, Heidelberg (2005)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Milanova, A., Rountev, A., Ryder, B.: Parameterized object sensitivity for points-to and side-effect analyses for Java. In: ISSTA (2002)","DOI":"10.1145\/566172.566174"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Muthukumar, K., Hermenegildo, M.: Compile-time derivation of variable dependency using abstract interpretation. JLP\u00a013(2\/3) (1992)","DOI":"10.1016\/0743-1066(92)90035-2"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-77050-3_4","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"T. Reps","year":"2007","unstructured":"Reps, T., Lal, A., Kidd, N.: Program Analysis Using Weighted Pushdown Systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 23\u201351. Springer, Heidelberg (2007)"},{"key":"3_CR25","unstructured":"Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: LICS (2002)"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Rinetzky, N., Bauer, J., Reps, T., Sagiv, S., Wilhelm, R.: A semantics for procedure local heaps and its abstractions. In: POPL (2005)","DOI":"10.1145\/1040305.1040330"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Smaragdakis, Y., Bravenboer, M., Lhot\u00e1k, O.: Pick your contexts well: understanding object-sensitivity. In: POPL (2011)","DOI":"10.1145\/1926385.1926390"},{"key":"3_CR28","unstructured":"Standard Performance Evaluation Corporation. JVM98 Version 1.04 (August 1998), \n                    \n                      http:\/\/www.spec.org\/jvm98"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Whaley, J., Lam, M.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: PLDI (2004)","DOI":"10.1145\/996841.996859"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Wilson, R., Lam, M.: Efficient context-sensitive pointer analysis for C programs. In: PLDI (1995)","DOI":"10.1145\/207110.207111"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-70545-1_36","volume-title":"Computer Aided Verification","author":"H. Yang","year":"2008","unstructured":"Yang, H., Lee, O., Berdine, J., Calcagno, C., Cook, B., Distefano, D., O\u2019Hearn, P.: Scalable Shape Analysis for Systems Code. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 385\u2013398. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28652-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:04:08Z","timestamp":1620111848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28652-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642286513","9783642286520"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28652-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}