{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:15:33Z","timestamp":1775873733018,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":102,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T00:00:00Z","timestamp":1491264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-14-1-0549,N00014-16-1-2913"],"award-info":[{"award-number":["N00014-14-1-0549,N00014-16-1-2913"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-1321179,CNS-1613023,CNS-1617513,CNS-1617481"],"award-info":[{"award-number":["CNS-1321179,CNS-1613023,CNS-1617513,CNS-1617481"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1409829"],"award-info":[{"award-number":["CCF-1409829"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,4]]},"DOI":"10.1145\/3037697.3037744","type":"proceedings-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T08:47:40Z","timestamp":1491382060000},"page":"389-404","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":56,"title":["Graspan"],"prefix":"10.1145","author":[{"given":"Kai","family":"Wang","sequence":"first","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]},{"given":"Aftab","family":"Hussain","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]},{"given":"Zhiqiang","family":"Zuo","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]},{"given":"Guoqing","family":"Xu","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]},{"given":"Ardalan","family":"Amiri Sani","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,4,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"http:\/\/findbugs.sourceforge.net\/","author":"The","year":"2015","unstructured":"The findbugs Java static checker. http:\/\/findbugs.sourceforge.net\/ , 2015 . The findbugs Java static checker. http:\/\/findbugs.sourceforge.net\/, 2015."},{"key":"e_1_3_2_1_2_1","volume-title":"http:\/\/www.coverity.com\/","author":"The Coverity","year":"2016","unstructured":"The Coverity code checker. http:\/\/www.coverity.com\/ , 2016 . The Coverity code checker. http:\/\/www.coverity.com\/, 2016."},{"key":"e_1_3_2_1_3_1","unstructured":"The GrammaTech CodeSonar static checker 2016. The GrammaTech CodeSonar static checker 2016."},{"key":"e_1_3_2_1_4_1","unstructured":"The HP Fortify static checker 2016. The HP Fortify static checker 2016."},{"key":"e_1_3_2_1_5_1","unstructured":"The KlocWork static checker 2016. The KlocWork static checker 2016."},{"key":"e_1_3_2_1_6_1","volume-title":"http:\/\/llvm.linuxfoundation.org\/","author":"The","year":"2016","unstructured":"The LLVMLinux project. http:\/\/llvm.linuxfoundation.org\/ , 2016 . The LLVMLinux project. http:\/\/llvm.linuxfoundation.org\/, 2016."},{"key":"e_1_3_2_1_7_1","volume-title":"http:\/\/www.logicblox.com\/","author":"LogicBlox The","year":"2016","unstructured":"The LogicBlox Datalog engine. http:\/\/www.logicblox.com\/ , 2016 . The LogicBlox Datalog engine. http:\/\/www.logicblox.com\/, 2016."},{"key":"e_1_3_2_1_8_1","unstructured":"Personal communication with John Criswell 2016. Personal communication with John Criswell 2016."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1251535.1251543"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265564"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1075382.1075387"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007390"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/6617.6621"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24756-2_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378846"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676977"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640108"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872364"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.15"},{"key":"e_1_3_2_1_20_1","first-page":"209","volume-title":"OSDI","author":"Cadar C.","year":"2008","unstructured":"C. Cadar , D. Dunbar , and D. Engler . KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs . In OSDI , pages 209 -- 224 , 2008 . C. Cadar, D. Dunbar, and D. Engler. KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In OSDI, pages 209--224, 2008."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/1180405.1180445","volume-title":"CCS","author":"Cadar C.","year":"2006","unstructured":"C. Cadar , V. Ganesh , P. M. Pawlowski , D. L. Dill , and D. R. Engler . EXE: Automatically generating inputs of death . In CCS , pages 322 -- 335 , 2006 . C. Cadar, V. Ganesh, P. M. Pawlowski, D. L. Dill, and D. R. Engler. EXE: Automatically generating inputs of death. In CCS, pages 322--335, 2006."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600233"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741970"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502042"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378811"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007512.1007515"},{"key":"e_1_3_2_1_27_1","unstructured":"D. Engler. Making finite verification of raw C code easier than writing a test case. In RV. Invited talk. D. Engler. Making finite verification of raw C code easier than writing a test case. In RV. Invited talk."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251229.1251230"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502041"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146238.1146254"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301665"},{"key":"e_1_3_2_1_32_1","first-page":"17","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . Powergraph: Distributed graph-parallel computation on natural graphs . In OSDI , pages 17 -- 30 , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI, pages 17--30, 2012."},{"key":"e_1_3_2_1_33_1","first-page":"599","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2014","unstructured":"J. E. Gonzalez , R. S. Xin , A. Dave , D. Crankshaw , M. J. Franklin , and I. Stoica . GraphX: Graph processing in a distributed dataflow framework . In OSDI , pages 599 -- 613 , 2014 . J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica. GraphX: Graph processing in a distributed dataflow framework. In OSDI, pages 599--613, 2014."},{"key":"e_1_3_2_1_34_1","first-page":"599","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2014","unstructured":"J. E. Gonzalez , R. S. Xin , A. Dave , D. Crankshaw , M. J. Franklin , and I. Stoica . GraphX: Graph processing in a distributed dataflow framework . In OSDI , pages 599 -- 613 , 2014 . J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica. GraphX: Graph processing in a distributed dataflow framework. In OSDI, pages 599--613, 2014."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512539"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/379605.379665","volume-title":"PASTE","author":"Hind M.","year":"2001","unstructured":"M. Hind . Pointer analysis : Haven't we solved this problem yet ? In PASTE , pages 54 -- 61 , 2001 . M. Hind. Pointer analysis: Haven't we solved this problem yet? In PASTE, pages 54--61, 2001."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/222124.222146"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"G. F. Italiano. Amortized efficiency of a path retrieval data structure. Theor. Comput. Sci. 48(2--3):273--281 1986. G. F. Italiano. Amortized efficiency of a path retrieval data structure. Theor. Comput. Sci. 48(2--3):273--281 1986.","DOI":"10.1016\/0304-3975(86)90098-8"},{"key":"e_1_3_2_1_40_1","first-page":"9","volume-title":"USENIX Security","author":"Johnson R.","year":"2004","unstructured":"R. Johnson and D. Wagner . Finding user\/kernel pointer bugs with type inference . In USENIX Security , pages 9 -- 9 , 2004 . R. Johnson and D. Wagner. Finding user\/kernel pointer bugs with type inference. In USENIX Security, pages 9--9, 2004."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462191"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996867"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250772"},{"key":"e_1_3_2_1_44_1","first-page":"31","volume-title":"OSDI","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . GraphChi: Large-scale graph computation on just a PC . In OSDI , pages 31 -- 46 , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: Large-scale graph computation on just a PC. In OSDI, pages 31--46, 2012."},{"key":"e_1_3_2_1_45_1","first-page":"278","volume-title":"ICDE","author":"Lam M. S.","year":"2013","unstructured":"M. S. Lam , S. Guo , and J. Seo . SociaLite: Datalog extensions for efficient social network analysis . In ICDE , pages 278 -- 289 , 2013 . M. S. Lam, S. Guo, and J. Seo. SociaLite: Datalog extensions for efficient social network analysis. In ICDE, pages 278--289, 2013."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/800217.806614"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250766"},{"key":"e_1_3_2_1_48_1","first-page":"20","volume-title":"OSDI","author":"Li Z.","year":"2004","unstructured":"Z. Li , S. Lu , S. Myagmar , and Y. Zhou . CP-Miner: A tool for finding copy-paste and related bugs in operating system code . In OSDI , pages 20 -- 20 , 2004 . Z. Li, S. Lu, S. Myagmar, and Y. Zhou. CP-Miner: A tool for finding copy-paste and related bugs in operating system code. In OSDI, pages 20--20, 2004."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081755"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2014.7004226"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1512475.1512486"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00049-9"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065887.1065892"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1352592.1352618"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950401"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806934"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/360204.360208","volume-title":"POPL","author":"Rehof J.","year":"2001","unstructured":"J. Rehof and M. F\\\"ahndrich. Type-based flow analysis: From polymorphic subtyping to CFL-reachability . In POPL , pages 54 -- 66 , 2001 . J. Rehof and M. F\\\"ahndrich. Type-based flow analysis: From polymorphic subtyping to CFL-reachability. In POPL, pages 54--66, 2001."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57877-3_26"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/215465.215466"},{"key":"e_1_3_2_1_64_1","volume-title":"Information and Software Technology, 40(11--12):701--726","author":"Reps T.","year":"1998","unstructured":"T. Reps . Program analysis via graph reachability. Information and Software Technology, 40(11--12):701--726 , 1998 . T. Reps. Program analysis via graph reachability. Information and Software Technology, 40(11--12):701--726, 1998."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/193173.195287"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007387"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542506"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001434"},{"key":"e_1_3_2_1_72_1","volume-title":"Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science, 167(1--2):131--170","author":"Sagiv M.","year":"1996","unstructured":"M. Sagiv , T. Reps , and S. Horwitz . Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science, 167(1--2):131--170 , 1996 . M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science, 167(1--2):131--170, 1996."},{"key":"e_1_3_2_1_73_1","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications","author":"Sharir M.","year":"1981","unstructured":"M. Sharir and A. Pnueli . Two approaches to interprocedural data flow analysis . In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications , pages 189 -- 234 . Prentice Hall , 1981 . M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, pages 189--234. Prentice Hall, 1981."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915229"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926390"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2666356.2594320"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134027"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094817"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676997"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/2992784"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037748"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660227"},{"key":"e_1_3_2_1_84_1","first-page":"507","volume-title":"USENIX ATC","author":"Vora K.","year":"2016","unstructured":"K. Vora , G. Xu , and R. Gupta . Load the edges you need: A generic I\/O optimization for disk-based graph processing . In USENIX ATC , pages 507 -- 522 , 2016 . K. Vora, G. Xu, and R. Gupta. Load the edges you need: A generic I\/O optimization for disk-based graph processing. In USENIX ATC, pages 507--522, 2016."},{"key":"e_1_3_2_1_85_1","volume-title":"CIDR","author":"Wang G.","year":"2013","unstructured":"G. Wang , W. Xie , A. Demers , and J. Gehrke . Asynchronous large-scale graph processing made easy . In CIDR , 2013 . G. Wang, W. Xie, A. Demers, and J. Gehrke. Asynchronous large-scale graph processing made easy. In CIDR, 2013."},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824052"},{"key":"e_1_3_2_1_87_1","first-page":"387","volume-title":"USENIX ATC","author":"Wang K.","year":"2015","unstructured":"K. Wang , G. Xu , Z. Su , and Y. D. Liu . GraphQ: Graph query processing with abstraction refinement\\textemdashprogrammable and budget-aware analytical queries over very large graphs on a single PC . In USENIX ATC , pages 387 -- 401 , 2015 . K. Wang, G. Xu, Z. Su, and Y. D. Liu. GraphQ: Graph query processing with abstraction refinement\\textemdashprogrammable and budget-aware analytical queries over very large graphs on a single PC. In USENIX ATC, pages 387--401, 2015."},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522728"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.75"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996859"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03013-0_6"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001440"},{"key":"e_1_3_2_1_93_1","first-page":"10","volume-title":"OSDI","author":"Yang J.","year":"2006","unstructured":"J. Yang , C. Sar , and D. Engler . EXPLODE: A lightweight, general system for finding serious storage system errors . In OSDI , pages 10 -- 10 , 2006 . J. Yang, C. Sar, and D. Engler. EXPLODE: A lightweight, general system for finding serious storage system errors. In OSDI, pages 10--10, 2006."},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298576"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01209711"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301647"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462159"},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009848"},{"key":"e_1_3_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660213"},{"key":"e_1_3_2_1_100_1","first-page":"45","volume-title":"FAST","author":"Zheng D.","year":"2015","unstructured":"D. Zheng , D. Mhembere , R. Burns , J. Vogelstein , C. E. Priebe , and A. S. Szalay . FlashGraph: processing billion-node graphs on an array of commodity ssds . In FAST , pages 45 -- 58 , 2015 . D. Zheng, D. Mhembere, R. Burns, J. Vogelstein, C. E. Priebe, and A. S. Szalay. FlashGraph: processing billion-node graphs on an array of commodity ssds. In FAST, pages 45--58, 2015."},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328464"},{"key":"e_1_3_2_1_102_1","first-page":"375","volume-title":"USENIX ATC","author":"Zhu X.","year":"2015","unstructured":"X. Zhu , W. Han , and W. Chen . GridGraph: Large scale graph processing on a single machine using 2-level hierarchical partitioning . In USENIX ATC , pages 375 -- 386 , 2015 . X. Zhu, W. Han, and W. Chen. GridGraph: Large scale graph processing on a single machine using 2-level hierarchical partitioning. In USENIX ATC, pages 375--386, 2015."}],"event":{"name":"ASPLOS '17: Architectural Support for Programming Languages and Operating Systems","location":"Xi'an China","acronym":"ASPLOS '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGOPS ACM Special Interest Group on Operating Systems","SIGARCH ACM Special Interest Group on Computer Architecture","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3037697.3037744","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3037697.3037744","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3037697.3037744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:03:11Z","timestamp":1750201391000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3037697.3037744"}},"subtitle":["A Single-machine Disk-based Graph System for Interprocedural Static Analyses of Large-scale Systems Code"],"short-title":[],"issued":{"date-parts":[[2017,4,4]]},"references-count":102,"alternative-id":["10.1145\/3037697.3037744","10.1145\/3037697"],"URL":"https:\/\/doi.org\/10.1145\/3037697.3037744","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093337.3037744","asserted-by":"object"},{"id-type":"doi","id":"10.1145\/3093336.3037744","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,4,4]]},"assertion":[{"value":"2017-04-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}