{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:50:53Z","timestamp":1725670253530},"publisher-location":"Berlin, Heidelberg","reference-count":32,"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_4","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T21:02:02Z","timestamp":1332450122000},"page":"61-80","source":"Crossref","is-referenced-by-count":13,"title":["Parallel Replication-Based Points-To Analysis"],"prefix":"10.1007","author":[{"given":"Sandeep","family":"Putta","sequence":"first","affiliation":[]},{"given":"Rupesh","family":"Nasre","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Andersen, L.O.: Program analysis and specialization for the C programming language, PhD Thesis, DIKU, University of Copenhagen (1994)","key":"4_CR1"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/cpe.4330040502","volume":"4","author":"H.E. Bal","year":"1992","unstructured":"Bal, H.E., Frans Kaashoek, M., Tanenbaum, A.S., Jansen, J.: Replication techniques for speeding up parallel applications on distributed systems. Concurrency: Pract. Exper.\u00a04, 337\u2013355 (1992)","journal-title":"Concurrency: Pract. Exper."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1640089.1640096","volume-title":"OOPSLA 2009","author":"E.D. Berger","year":"2009","unstructured":"Berger, E.D., Yang, T., Liu, T., Novark, G.: Grace: safe multithreaded programming for c\/c++. In: OOPSLA 2009, pp. 81\u201396. ACM, New York (2009)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/781131.781144","volume-title":"Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, PLDI 2003","author":"M. Berndl","year":"2003","unstructured":"Berndl, M., Lhot\u00e1k, O., Qian, F., Hendren, L., Umanee, N.: Points-to analysis using bdds. In: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, PLDI 2003, pp. 103\u2013114. ACM, New York (2003)"},{"key":"4_CR5","first-page":"691","volume-title":"OOPSLA 2010","author":"S. Burckhardt","year":"2010","unstructured":"Burckhardt, S., Baldassin, A., Leijen, D.: Concurrent programming with revisions and isolation types. In: OOPSLA 2010, pp. 691\u2013707. ACM, New York (2010)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/349299.349309","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2000","author":"M. Das","year":"2000","unstructured":"Das, M.: Unification-based pointer analysis with directional assignments. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2000, pp. 35\u201346. ACM, New York (2000)"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1944862.1944872","volume-title":"Proceedings of the 6th International Conference on High Performance and Embedded Architectures and Compilers, HiPEAC 2011","author":"M. Edvinsson","year":"2011","unstructured":"Edvinsson, M., Lundberg, J., L\u00f6we, W.: Parallel points-to analysis for multi-core machines. In: Proceedings of the 6th International Conference on High Performance and Embedded Architectures and Compilers, HiPEAC 2011, pp. 45\u201354. ACM, New York (2011)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/178243.178264","volume-title":"Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation, PLDI 1994","author":"M. Emami","year":"1994","unstructured":"Emami, M., Ghiya, R., Hendren, L.J.: Context-sensitive interprocedural points-to analysis in the presence of function pointers. In: Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation, PLDI 1994, pp. 242\u2013256. ACM, New York (1994)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/277650.277667","volume-title":"Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, PLDI 1998","author":"M. F\u00e4hndrich","year":"1998","unstructured":"F\u00e4hndrich, M., Foster, J.S., Su, Z., Aiken, A.: Partial online cycle elimination in inclusion constraint graphs. In: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, PLDI 1998, pp. 85\u201396. ACM, New York (1998)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/349299.349332","volume-title":"Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, PLDI 2000","author":"M. F\u00e4hndrich","year":"2000","unstructured":"F\u00e4hndrich, M., Rehof, J., Das, M.: Scalable context-sensitive flow analysis using instantiation constraints. In: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, PLDI 2000, pp. 253\u2013263. ACM, New York (2000)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/800215.806583","volume-title":"SOSP 1979","author":"D.K. Gifford","year":"1979","unstructured":"Gifford, D.K.: Weighted voting for replicated data. In: SOSP 1979, pp. 150\u2013162. ACM, New York (1979)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/1250734.1250767","volume-title":"Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2007","author":"B. Hardekopf","year":"2007","unstructured":"Hardekopf, B., Lin, C.: The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code. In: Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2007, pp. 290\u2013299. ACM, New York (2007)"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1596527.1596528","volume":"32","author":"M. Harman","year":"2009","unstructured":"Harman, M., Binkley, D., Gallagher, K., Gold, N., Krinke, J.: Dependence clusters in source code. ACM Trans. Program. Lang. Syst.\u00a032, 1:1\u20131:33 (2009)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1145\/378795.378855","volume-title":"Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, PLDI 2001","author":"N. Heintze","year":"2001","unstructured":"Heintze, N., Tardieu, O.: Ultra-fast aliasing analysis using cla: a million lines of c code in a second. In: Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, PLDI 2001, pp. 254\u2013263. ACM, New York (2001)"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/347324.348916","volume-title":"Proceedings of the 2000 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2000","author":"M. Hind","year":"2000","unstructured":"Hind, M., Pioli, A.: Which pointer analysis should i use? In: Proceedings of the 2000 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2000, pp. 113\u2013123. ACM, New York (2000)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/6306.6309","volume":"4","author":"T.A. Joseph","year":"1986","unstructured":"Joseph, T.A., Birman, K.P.: Low cost management of replicated data in fault-tolerant distributed systems. ACM Trans. Comput. Syst.\u00a04, 54\u201370 (1986)","journal-title":"ACM Trans. Comput. Syst."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/1375581.1375613","volume-title":"Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, PLDI 2008","author":"V. Kahlon","year":"2008","unstructured":"Kahlon, V.: Bootstrapping: a technique for scalable flow and context-sensitive pointer alias analysis. In: Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, PLDI 2008, pp. 249\u2013259. ACM, New York (2008)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/1250734.1250766","volume-title":"Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2007","author":"C. Lattner","year":"2007","unstructured":"Lattner, C., Lenharth, A., Adve, V.: Making context-sensitive points-to analysis with heap cloning practical for the real world. In: Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2007, pp. 278\u2013289. ACM, New York (2007)"},{"key":"4_CR19","volume-title":"Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2012","author":"M. M\u00e9ndez-Lojo","year":"2012","unstructured":"M\u00e9ndez-Lojo, M., Burtscher, M., Pingali, K.: A gpu implementation of inclusion-based points-to analysis. In: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2012. ACM, New York (2012)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1145\/1869459.1869495","volume-title":"Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications, OOPSLA 2010","author":"M. M\u00e9ndez-Lojo","year":"2010","unstructured":"M\u00e9ndez-Lojo, M., Mathew, A., Pingali, K.: Parallel inclusion-based points-to analysis. In: Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications, OOPSLA 2010, pp. 428\u2013443. ACM, New York (2010)"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1988915.1988931","volume-title":"Proceedings of the 2011 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, MSPC 2011","author":"R. Nasre","year":"2011","unstructured":"Nasre, R.: Approximating inclusion-based points-to analysis. In: Proceedings of the 2011 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, MSPC 2011, pp. 66\u201373. ACM, New York (2011)"},{"doi-asserted-by":"crossref","unstructured":"Nasre, R., Govindarajan, R.: Prioritizing constraint evaluation for efficient points-to analysis. In: Proceedings of the 9th IEEE\/ACM International Symposium on Code Generation and Optimization, CGO 2011, pp. 267\u2013276 (April 2011)","key":"4_CR22","DOI":"10.1109\/CGO.2011.5764694"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-10672-9_6","volume-title":"Programming Languages and Systems","author":"R. Nasre","year":"2009","unstructured":"Nasre, R., Rajan, K., Govindarajan, R., Khedker, U.P.: Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol.\u00a05904, pp. 47\u201362. Springer, Heidelberg (2009)"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/CGO.2009.9","volume-title":"Proceedings of the 7th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO 2009","author":"F.M.Q. Pereira","year":"2009","unstructured":"Pereira, F.M.Q., Berlin, D.: Wave propagation and deep propagation for pointer analysis. In: Proceedings of the 7th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO 2009, pp. 126\u2013135. IEEE Computer Society, Washington, DC (2009)"},{"key":"4_CR25","first-page":"511","volume-title":"POPL 2011","author":"T. Prabhu","year":"2011","unstructured":"Prabhu, T., Ramalingam, S., Might, M., Hall, M.: Eigencfa: accelerating flow analysis with gpus. In: POPL 2011, pp. 511\u2013522. ACM, New York (2011)"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/349299.349310","volume-title":"Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, PLDI 2000","author":"A. Rountev","year":"2000","unstructured":"Rountev, A., Chandra, S.: Off-line variable substitution for scaling points-to analysis. In: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, PLDI 2000, pp. 47\u201356. ACM, New York (2000)"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/263699.263705","volume-title":"Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1997","author":"E. Ruf","year":"1997","unstructured":"Ruf, E.: Partitioning dataflow analyses using types. In: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1997, pp. 15\u201326. ACM, New York (1997)"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/237721.237727","volume-title":"Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1996","author":"B. Steensgaard","year":"1996","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1996, pp. 32\u201341. ACM, New York (1996)"},{"issue":"2","key":"4_CR29","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-45789-5_15","volume-title":"Static Analysis","author":"J. Whaley","year":"2002","unstructured":"Whaley, J., Lam, M.S.: An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 180\u2013195. Springer, Heidelberg (2002)"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/239098.239112","volume-title":"Proceedings of the 4th ACM SIGSOFT Symposium on Foundations of Software Engineering, SIGSOFT 1996","author":"S. Zhang","year":"1996","unstructured":"Zhang, S., Ryder, B.G., Landi, W.: Program decomposition for pointer aliasing: a step toward practical analyses. In: Proceedings of the 4th ACM SIGSOFT Symposium on Foundations of Software Engineering, SIGSOFT 1996, pp. 81\u201392. ACM, New York (1996)"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-69330-7_5","volume-title":"Languages and Compilers for Parallel Computing","author":"H.E. Ziegler","year":"2006","unstructured":"Ziegler, H.E., Malusare, P.L., Diniz, P.C.: Array Replication to Increase Parallelism in Applications Mapped to Configurable Architectures. In: Ayguad\u00e9, E., Baumgartner, G., Ramanujam, J., Sadayappan, P. (eds.) LCPC 2005. LNCS, vol.\u00a04339, pp. 62\u201375. Springer, Heidelberg (2006)"}],"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_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T02:21:17Z","timestamp":1641435677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28652-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642286513","9783642286520"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28652-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}