{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:54:22Z","timestamp":1771959262260,"version":"3.50.1"},"reference-count":39,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1109\/cgo.2013.6494978","type":"proceedings-article","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T17:38:10Z","timestamp":1365701890000},"page":"1-11","source":"Crossref","is-referenced-by-count":21,"title":["Query-directed adaptive heap cloning for optimizing compilers"],"prefix":"10.1109","author":[{"family":"Yulei Sui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Yue Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Jingling Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025160"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001443"},{"key":"17","first-page":"47","article-title":"Context-sensitive points-to analysis: Is it worth it?","author":"lhota?k","year":"0","journal-title":"CCC'06"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1145\/1390630.1390658"},{"key":"18","article-title":"Evaluating the benefits of contextsensitive points-to analysis using a bdd-based implementation","volume":"18","author":"lhota?k","year":"2008","journal-title":"TOSEM'08"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996859"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065027"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207111"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250766"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996860"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375613"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/143095.143137"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772985"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480911"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328464"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2011.5764696"},{"key":"21","article-title":"An incremental points-to analysis with CFL-reachability","author":"lu","year":"0","journal-title":"CC '11"},{"key":"20","first-page":"279","article-title":"Efficient computation of parameterized pointer information for interprocedural analyses","author":"liang","year":"0","journal-title":"SAS'01"},{"key":"22","author":"nystrom","year":"2006","journal-title":"FULCRA Pointer Analysis Framework"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/996821.996836"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2009.9"},{"key":"25","first-page":"267","article-title":"Prioritizing constraint evaluation for efficient points-to analysis","author":"rupesh nasre","year":"0","journal-title":"CGO '11"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/514188.514190"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1145\/2351676.2351720"},{"key":"28","first-page":"264","article-title":"On-demand dynamic summarybased points-to analysis","author":"shang","year":"0","journal-title":"CGO '11"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134027"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480917"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781144"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250767"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2006.37"},{"key":"30","first-page":"77","article-title":"Meta optimization: Improving compiler heuristics with machine learning","author":"stephenson","year":"0","journal-title":"PLDI '03"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993565"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806647"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336784"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292554"},{"key":"31","first-page":"155","article-title":"SPAS: Scalable pathsensitive pointer analysis on full-sparse SSA","author":"sui","year":"0","journal-title":"APLAS '11"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328469"},{"key":"9","first-page":"1073","article-title":"Client-driven pointer analysis","author":"guyer","year":"0","journal-title":"SASN '03"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178264"}],"event":{"name":"2013 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)","location":"Shenzhen","start":{"date-parts":[[2013,2,23]]},"end":{"date-parts":[[2013,2,27]]}},"container-title":["Proceedings of the 2013 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6489844\/6494968\/06494978.pdf?arnumber=6494978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T22:10:47Z","timestamp":1490220647000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6494978\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/cgo.2013.6494978","relation":{},"subject":[],"published":{"date-parts":[[2013,2]]}}}