{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:10:09Z","timestamp":1746418209115,"version":"3.40.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319127354"},{"type":"electronic","value":"9783319127361"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12736-1_21","type":"book-chapter","created":{"date-parts":[[2014,10,13]],"date-time":"2014-10-13T14:53:24Z","timestamp":1413212004000},"page":"392-407","source":"Crossref","is-referenced-by-count":0,"title":["Syntax-Directed Divide-and-Conquer Data-Flow Analysis"],"prefix":"10.1007","author":[{"given":"Shigeyuki","family":"Sato","sequence":"first","affiliation":[]},{"given":"Akimasa","family":"Morihata","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Albarghouthi, A., Kumar, R., Nori, A.V., Rajamani, S.K.: Parallelizing Top-Down Interprocedural Analyses. In: Proc. PLDI 2012, pp. 217\u2013228 (2012)","key":"21_CR1","DOI":"10.1145\/2345156.2254091"},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/360018.360025","volume":"19","author":"F.E. Allen","year":"1976","unstructured":"Allen, F.E., Cocke, J.: A Program Data Flow Analysis Procedure. Commun. ACM\u00a019(3), 137\u2013147 (1976)","journal-title":"Commun. ACM"},{"issue":"5","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1145\/186025.186043","volume":"16","author":"U.P. Khedker","year":"1994","unstructured":"Khedker, U.P., Dhamdhere, D.M.: A Generalized Theory of Bit Vector Data Flow Analysis. ACM Trans. Program. Lang. Syst.\u00a016(5), 1472\u20131511 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"doi-asserted-by":"crossref","unstructured":"Kildall, G.A.: A Unified Approach to Global Program Optimization. In: Proc. POPL 1973, pp. 194\u2013206 (1973)","key":"21_CR4","DOI":"10.1145\/512927.512945"},{"issue":"8","key":"21_CR5","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/71.298205","volume":"5","author":"R. Kramer","year":"1994","unstructured":"Kramer, R., Gupta, R., Soffa, M.L.: The Combining DAG: A Technique for Parallel Data Flow Analysis. IEEE T. Parall Distr.\u00a05(8), 805\u2013813 (1994)","journal-title":"IEEE T. Parall Distr."},{"issue":"11","key":"21_CR6","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1109\/32.473220","volume":"21","author":"Y.F. Lee","year":"1995","unstructured":"Lee, Y.F., Ryder, B.G., Fiuczynski, M.E.: Region Analysis: A Parallel Elimination Method for Data Flow Analysis. IEEE Software Eng.\u00a021(11), 913\u2013926 (1995)","journal-title":"IEEE Software Eng."},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01237234","volume":"28","author":"T.J. Marlowe","year":"1990","unstructured":"Marlowe, T.J., Ryder, B.G.: Properties of data flow frameworks. Acta Inform.\u00a028(2), 121\u2013163 (1990)","journal-title":"Acta Inform."},{"doi-asserted-by":"crossref","unstructured":"M\u00e9ndez-Lojo, M., Burtscher, M., Pingali, K.: A GPU Implementation of Inclusion-based Points-to Analysis. In: Proc. PPoPP 2012, pp. 107\u2013116 (2012)","key":"21_CR8","DOI":"10.1145\/2370036.2145831"},{"doi-asserted-by":"crossref","unstructured":"M\u00e9ndez-Lojo, M., Mathew, A., Pingali, K.: Parallel Inclusion-based Points-to Analysis. In: Proc. OOPSLA 2010, pp. 428\u2013443 (2010)","key":"21_CR9","DOI":"10.1145\/1932682.1869495"},{"doi-asserted-by":"crossref","unstructured":"Mintz, R.J., Fisher, G.A., Sharir, M.: The design of a global optimizer. In: Proc. SIGPLAN Symposium on Compiler Construction 1979, pp. 226\u2013234 (1979)","key":"21_CR10","DOI":"10.1145\/872732.806974"},{"doi-asserted-by":"crossref","unstructured":"Prabhu, T., Ramalingam, S., Might, M., Hall, M.: EigenCFA: Accelerating Flow Analysis with GPUs. In: Proc. POPL 2011, pp. 511\u2013522 (2011)","key":"21_CR11","DOI":"10.1145\/1925844.1926445"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-19861-8_11","volume-title":"Compiler Construction","author":"J. Rodriguez","year":"2011","unstructured":"Rodriguez, J., Lhot\u00e1k, O.: Actor-Based Parallel Dataflow Analysis. In: Knoop, J. (ed.) CC 2011. LNCS, vol.\u00a06601, pp. 179\u2013197. Springer, Heidelberg (2011)"},{"issue":"10","key":"21_CR13","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1145\/359842.359849","volume":"20","author":"B.K. Rosen","year":"1977","unstructured":"Rosen, B.K.: High-Level Data Flow Analysis. Commun. ACM\u00a020(10), 712\u2013724 (1977)","journal-title":"Commun. ACM"},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/0209015","volume":"9","author":"B.K. Rosen","year":"1980","unstructured":"Rosen, B.K.: Monoids for Rapid Data Flow Analysis. SIAM J. Comput.\u00a09(1), 159\u2013196 (1980)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/27632.27649","volume":"18","author":"B.G. Ryder","year":"1986","unstructured":"Ryder, B.G., Paull, M.C.: Elimination Algorithms for Data Flow Analysis. ACM Comput. Surv.\u00a018(3), 277\u2013316 (1986)","journal-title":"ACM Comput. Surv."},{"unstructured":"Sharir, M., Pnueli, A.: Two Approaches to Inter-Procedural Data-Flow Analysis. Prentice-Hall (1981)","key":"21_CR16"},{"issue":"3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/322261.322272","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: A Unified Approach to Path Problems. J. ACM\u00a028(3), 577\u2013593 (1981)","journal-title":"J. ACM"},{"issue":"3","key":"21_CR18","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: Fast Algorithms for Solving Path Problems. J. ACM\u00a028(3), 594\u2013614 (1981)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Vaivaswatha, N., Govindarajan, R.: Parallel Flow-Sensitive Pointer Analysis by Graph-Rewriting. In: Proc. PACT 2013, pp. 19\u201328 (2013)","key":"21_CR19","DOI":"10.1109\/PACT.2013.6618793"}],"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-319-12736-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T03:47:34Z","timestamp":1746416854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12736-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319127354","9783319127361"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12736-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}