{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:23:20Z","timestamp":1779074600910,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642548321","type":"print"},{"value":"9783642548338","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54833-8_27","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T09:37:17Z","timestamp":1395394637000},"page":"513-533","source":"Crossref","is-referenced-by-count":14,"title":["A Correspondence between Two Approaches to Interprocedural Analysis in the Presence of Join"],"prefix":"10.1007","author":[{"given":"Ravi","family":"Mangal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mayur","family":"Naik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongseok","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-49538-X_2","volume-title":"ECOOP \u201995 - Object-Oriented Programming","author":"O. Agesen","year":"1995","unstructured":"Agesen, O.: The cartesian product algorithm. In: Olthoff, W. (ed.) ECOOP 1995. LNCS, vol.\u00a0952, pp. 2\u201326. Springer, Heidelberg (1995)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Besson, F.: CPA beats \u221e-CFA. In: FTfJP (2009)","DOI":"10.1145\/1557898.1557905"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Berndl, M., Lhot\u00e1k, O., Qian, F., Hendren, L., Umanee, N.: Points-to analysis using BDDs. In: PLDI (2003)","DOI":"10.1145\/781131.781144"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-45319-9_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Ball","year":"2001","unstructured":"Ball, T., Podelski, A., Rajamani, S.K.: Boolean and cartesian abstraction for model checking C programs. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 268\u2013283. Springer, Heidelberg (2001)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.: Bebop: a path-sensitive interprocedural dataflow engine. In: PASTE (2001)","DOI":"10.1145\/379605.379690"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Bravenboer, M., Smaragdakis, Y.: Strictly declarative specification of sophisticated points-to analyses. In: OOPSLA (2009)","DOI":"10.1145\/1640089.1640108"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL (1979)","DOI":"10.1145\/567752.567778"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. Journal of Logic and Computation\u00a02(4) (1992)","DOI":"10.1093\/logcom\/2.4.511"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Fink, S., Yahav, E., Dor, N., Ramalingam, G., Geay, E.: Effective typestate verification in the presence of aliasing. ACM TOSEM\u00a017(2) (2008)","DOI":"10.1145\/1348250.1348255"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Grove, D., Chambers, C.: A framework for call graph construction algorithms. ACM TOPLAS\u00a023(6) (2001)","DOI":"10.1145\/506315.506316"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78791-4_15","volume-title":"Compiler Construction","author":"U.P. Khedker","year":"2008","unstructured":"Khedker, U.P., Karkare, B.: Efficiency, precision, simplicity, and generality in interprocedural dataflow analysis: Resurrecting the classical call strings method. In: Hendren, L. (ed.) CC 2008. LNCS, vol.\u00a04959, pp. 213\u2013228. Springer, Heidelberg (2008)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-33125-1_19","volume-title":"Static Analysis","author":"U.P. Khedker","year":"2012","unstructured":"Khedker, U.P., Mycroft, A., Rawat, P.S.: Liveness-based pointer analysis. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol.\u00a07460, pp. 265\u2013282. Springer, Heidelberg (2012)"},{"key":"27_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 TOSEM\u00a018(1) (2008)","DOI":"10.1145\/1391984.1391987"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Min\u00e9, A.: The octagon abstract domain. Higher-Order and Symbolic Computation\u00a019(1) (2006)","DOI":"10.1007\/s10990-006-8609-1"},{"key":"27_CR15","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\/566173.566174"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Milanova, A., Rountev, A., Ryder, B.G.: Parameterized object sensitivity for points-to analysis for Java. ACM TOSEM\u00a014(1) (2005)","DOI":"10.1145\/1044834.1044835"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Might, M., Smaragdakis, Y., Horn, D.: Resolving and exploiting the k-CFA paradox: illuminating functional vs. oo program analysis. In: PLDI (2010)","DOI":"10.1145\/1806596.1806631"},{"key":"27_CR18","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":"27_CR19","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL (1995)","DOI":"10.1145\/199448.199462"},{"key":"27_CR20","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":"27_CR21","doi-asserted-by":"crossref","unstructured":"Shivers, O.: Control-flow analysis in scheme. In: PLDI (1988)","DOI":"10.1145\/53990.54007"},{"key":"27_CR22","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program Flow Analysis: Theory and Applications, ch. 7. Prentice-Hall (1981)"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/978-3-642-11957-6_30","volume-title":"Programming Languages and Systems","author":"D. Vardoulakis","year":"2010","unstructured":"Vardoulakis, D., Shivers, O.: CFA2: A Context-Free Approach to Control-Flow Analysis. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol.\u00a06012, pp. 570\u2013589. Springer, Heidelberg (2010)"},{"key":"27_CR24","unstructured":"Whaley, J.: Context-Sensitive Pointer Analysis using Binary Decision Diagrams. PhD thesis, Stanford University (March 2007)"},{"key":"27_CR25","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":"27_CR26","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.W.: Scalable shape analysis for systems code. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 385\u2013398. Springer, Heidelberg (2008)"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Zhu, J., Calman, S.: Symbolic pointer analysis revisited. In: PLDI (2004)","DOI":"10.1145\/996841.996860"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54833-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T12:26:59Z","timestamp":1558873619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54833-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548321","9783642548338"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54833-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}