{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:52:00Z","timestamp":1765961520268,"version":"3.37.3"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:00:00Z","timestamp":1648857600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:00:00Z","timestamp":1648857600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000287","name":"Royal Academy of Engineering","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000287","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,4,2]]},"DOI":"10.1109\/cgo53902.2022.9741269","type":"proceedings-article","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:51:20Z","timestamp":1648583480000},"page":"242-253","source":"Crossref","is-referenced-by-count":7,"title":["F3M: Fast Focused Function Merging"],"prefix":"10.1109","author":[{"given":"Sean","family":"Stirling","sequence":"first","affiliation":[{"name":"Codeplay,United Kingdom"}]},{"given":"Rocha","family":"Rodrigo C. O.","sequence":"additional","affiliation":[{"name":"University of Edinburgh,United Kingdom"}]},{"given":"Kim","family":"Hazelwood","sequence":"additional","affiliation":[{"name":"Facebook AI Research,United States"}]},{"given":"Hugh","family":"Leather","sequence":"additional","affiliation":[{"name":"Facebook AI Research,United States"}]},{"given":"Michael","family":"O'Boyle","sequence":"additional","affiliation":[{"name":"University of Edinburgh,United Kingdom"}]},{"given":"Pavlos","family":"Petoumenos","sequence":"additional","affiliation":[{"name":"University of Manchester,United Kingdom"}]}],"member":"263","reference":[{"key":"ref10","first-page":"21","article-title":"On the resemblance and containment of documents","author":"broder","year":"1997","journal-title":"Proceedings Compression and Complexity of SEQUENCES 1997 (Cat No 97TB100171)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"article-title":"Fowler \/ noll \/ vo (fnv) hash","year":"2001","author":"noll","key":"ref12"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1145\/36206.36194","article-title":"Superoptimizer: A look at the smallest program","author":"massalin","year":"1987","journal-title":"Proceedings of the Second International Conference on Architectual Support for Programming Languages and Operating Systems ser ASPLOS II"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/357153.357155"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/314403.314414"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178256"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/800028.808480"},{"key":"ref18","first-page":"401","article-title":"Code compaction of matching singleentry multiple-exit regions","author":"chen","year":"2003","journal-title":"Static Analysis"},{"key":"ref19","first-page":"79","article-title":"Code factoring in GCC","author":"l\u00f3ki","year":"2004","journal-title":"Proceedings of the 2004 GCC Developers' Summit"},{"key":"ref4","article-title":"Optimizing large applications","author":"li\u0161ka","year":"2014","journal-title":"arXiv preprint arXiv 1403 6997"},{"year":"2020","key":"ref3","article-title":"The LLVM Compiler Infrastructure. MergeFunctions pass, how it works"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661174"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2597809.2597811"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3461648.3463852"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386030"},{"year":"2021","key":"ref2","article-title":"Maximum build file sizes - app store connect help"},{"year":"2021","key":"ref1","article-title":"Create and set up your app - play console help"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370306"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/VLSI-TSA.2012.6210142"},{"key":"ref21","first-page":"253","article-title":"Safe ICF: Pointer safe and unwinding aware identical code folding in gold","author":"tallam","year":"2010","journal-title":"GCC Developer's summit"}],"event":{"name":"2022 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)","start":{"date-parts":[[2022,4,2]]},"location":"Seoul, Korea, Republic of","end":{"date-parts":[[2022,4,6]]}},"container-title":["2022 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9741235\/9741095\/09741269.pdf?arnumber=9741269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T20:23:42Z","timestamp":1675110222000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9741269\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,2]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/cgo53902.2022.9741269","relation":{},"subject":[],"published":{"date-parts":[[2022,4,2]]}}}