{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:11:34Z","timestamp":1774987894718,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642331244","type":"print"},{"value":"9783642331251","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33125-1_25","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T06:47:24Z","timestamp":1346222844000},"page":"370-387","source":"Crossref","is-referenced-by-count":12,"title":["Modular Heap Analysis for Higher-Order Programs"],"prefix":"10.1007","author":[{"given":"Ravichandhran","family":"Madhavan","sequence":"first","affiliation":[]},{"given":"G.","family":"Ramalingam","sequence":"additional","affiliation":[]},{"given":"Kapil","family":"Vaswani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45937-5_13","volume-title":"Compiler Construction","author":"P. Cousot","year":"2002","unstructured":"Cousot, P., Cousot, R.: Modular Static Program Analysis. In: CC 2002. LNCS, vol.\u00a02304, pp. 159\u2013179. Springer, Heidelberg (2002)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Grove, D., DeFouw, G., Dean, J., Chambers, C.: Call graph construction in object-oriented languages. In: OOPSLA, pp. 108\u2013124 (1997)","DOI":"10.1145\/263700.264352"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Lattner, C., Lenharth, A., Adve, V.S.: Making context-sensitive points-to analysis with heap cloning practical for the real world. In: PLDI, pp. 278\u2013289 (2007)","DOI":"10.1145\/1273442.1250766"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-23702-7_6","volume-title":"Static Analysis","author":"R. Madhavan","year":"2011","unstructured":"Madhavan, R., Ramalingam, G., Vaswani, K.: Purity Analysis: An Abstract Interpretation Formulation. In: Yahav, E. (ed.) SAS 2011. LNCS, vol.\u00a06887, pp. 7\u201324. Springer, Heidelberg (2011)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Madhavan, R., Ramalingam, G., Vaswani, K.: Purity analysis: An abstract interpretation formulation. Tech. rep., Microsoft Research (2011)","DOI":"10.1007\/978-3-642-23702-7_6"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Might, M., Smaragdakis, Y., Horn, D.V.: Resolving and exploiting the k-cfa paradox: Illuminating functional vs. object-oriented program analysis. In: PLDI, Toronto, Canada, pp. 305\u2013315 (June 2010)","DOI":"10.1145\/1809028.1806631"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/11688839_2","volume-title":"Compiler Construction","author":"A. Rountev","year":"2006","unstructured":"Rountev, A., Kagan, S., Marlowe, T.: Interprocedural Dataflow Analysis in the Presence of Large Libraries. In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 2\u201316. Springer, Heidelberg (2006)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-30579-8_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. S\u0103lcianu","year":"2005","unstructured":"S\u0103lcianu, A., Rinard, M.: Purity and Side Effect Analysis for Java Programs. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 199\u2013215. Springer, Heidelberg (2005)"},{"key":"25_CR9","unstructured":"Shivers, O.G.: Control-Flow Analysis of Higher-Order Languages or Taming Lambda. Ph.D. thesis, Carnegie-Mellon Univeristy (May 1991)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Vivien, F., Rinard, M.: Incrementalized pointer and escape analysis. In: PLDI, pp. 35\u201346 (2001)","DOI":"10.1145\/381694.378804"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Whaley, J., Rinard, M.C.: Compositional pointer and escape analysis for java programs. In: OOPSLA, pp. 187\u2013206 (1999)","DOI":"10.1145\/320385.320400"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33125-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:56:14Z","timestamp":1620129374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33125-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331244","9783642331251"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33125-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}