{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:14Z","timestamp":1750309454599,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","award":["304441\\\/2021-0"],"award-info":[{"award-number":["304441\\\/2021-0"]}]},{"name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","award":["PrInt"],"award-info":[{"award-number":["PrInt"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1145\/3696443.3708923","type":"proceedings-article","created":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T11:50:26Z","timestamp":1740225026000},"page":"660-674","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Honey Potion: An eBPF Backend for Elixir"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-8096-9991","authenticated-orcid":false,"given":"Kael Soares","family":"Augusto","sequence":"first","affiliation":[{"name":"Federal University of Minas Gerais, Belo Horizonte, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0117-7708","authenticated-orcid":false,"given":"Vin\u00edcius","family":"Pacheco","sequence":"additional","affiliation":[{"name":"Cadence, Belo Horizonte, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9152-4114","authenticated-orcid":false,"given":"Marcos A.","family":"Vieira","sequence":"additional","affiliation":[{"name":"Federal University of Minas Gerais, Belo Horizonte, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0131-5154","authenticated-orcid":false,"given":"Rodrigo Geraldo","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"Federal University of Ouro Preto, Jo\u00e3o Monlevade, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0375-1657","authenticated-orcid":false,"given":"Fernando Magno","family":"Quint\u00e3o Pereira","sequence":"additional","affiliation":[{"name":"Federal University of Minas Gerais, Belo Horizonte, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,3]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1017\/S0956796801004191"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/3110277"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/349299.349303"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1565824.1565827"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1017\/S0960129514000115"},{"key":"e_1_3_2_1_6_1","volume-title":"Landweber","author":"Brainerd Walter S.","year":"1974","unstructured":"Walter S. Brainerd and Lawrence H. Landweber. 1974. Theory of Computation. John Wiley & Sons, Inc., USA. isbn:0471095850"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.2168\/LMCS-1(2:1)2005"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/3290329"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/351240.351266"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/115372.115320"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/2892208.2892212"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1542476.1542528"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/3314221.3314590"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1093\/nsr"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/3593856.3595892"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/3359061.3361077"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1538788.1538814"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1016\/j.scico.2019.102318"},{"key":"e_1_3_2_1_19_1","volume-title":"MOAT: Towards Safe BPF Kernel Extension. arxiv:2301.13421.","author":"Lu Hongyi","year":"2023","unstructured":"Hongyi Lu, Shuai Wang, Yechang Wu, Wanning He, and Fengwei Zhang. 2023. MOAT: Towards Safe BPF Kernel Extension. arxiv:2301.13421."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/3547655"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/2814270.2814275"},{"key":"e_1_3_2_1_22_1","volume-title":"Mathematics of Program Construction, Ralf Hinze and Janis Voigtl\u00e4nder (Eds.)","author":"McBride Conor","year":"1979","unstructured":"Conor McBride. 2015. Turing-Completeness Totally Free. In Mathematics of Program Construction, Ralf Hinze and Janis Voigtl\u00e4nder (Eds.). Springer International Publishing, Cham. 257\u2013275. isbn:978-3-319-19797-5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/3609510.3609822"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/3434334"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/3290328"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/BF01941137"},{"volume-title":"Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation","author":"Ohlebusch Enno","unstructured":"Enno Ohlebusch. 1998. Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation. In RTA. Springer-Verlag, Berlin, Heidelberg. 17\u201331. isbn:354064301X","key":"e_1_3_2_1_27_1"},{"doi-asserted-by":"publisher","unstructured":"Fernando Magno Quintao Pereira. 2024. Artifact for Honey Potion: an eBPF Backend for Elixir. https:\/\/doi.org\/10.5281\/zenodo.13729837 Published on Zenodo. 10.5281\/zenodo.13729837","key":"e_1_3_2_1_28_1","DOI":"10.5281\/zenodo.13729837"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/3428235"},{"key":"e_1_3_2_1_30_1","volume-title":"Learning eBPF: Programming the Linux Kernel for Enhanced Observability, Networking, and Security","author":"Rice Liz","unstructured":"Liz Rice. 2023. Learning eBPF: Programming the Linux Kernel for Enhanced Observability, Networking, and Security (1st ed.). O\u2019Reilly Media, USA. isbn:1098135121","edition":"1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1109\/CGO.2013.6495006"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1007\/978-3-540-73589-2_2"},{"key":"e_1_3_2_1_33_1","volume-title":"Fernando Magno Quint\u00e3o Pereira, and Mariza A. S. Bigonha","author":"Sol Rodrigo","year":"2011","unstructured":"Rodrigo Sol, Christophe Guillon, Fernando Magno Quint\u00e3o Pereira, and Mariza A. S. Bigonha. 2011. Dynamic Elimination of Overflow Tests in a Trace Compiler. In Compiler Construction. Springer-Verlag, Berlin, Heidelberg. 2\u201321. isbn:9783642198601"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/258915.258935"},{"key":"e_1_3_2_1_35_1","volume-title":"Verified Functional Programming in Agda","author":"Stump Aaron","year":"1970","unstructured":"Aaron Stump. 2016. Verified Functional Programming in Agda. Association for Computing Machinery and Morgan & Claypool, New York, USA. isbn:9781970001273"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1145\/858570.858576"},{"volume-title":"Parameterized Construction of Program Representations for Sparse Dataflow Analyses","author":"Tavares Andr\u00e9","unstructured":"Andr\u00e9 Tavares, Benoit Boissinot, Fernando Pereira, and Fabrice Rastello. 2014. Parameterized Construction of Program Representations for Sparse Dataflow Analyses. In Compiler Construction, Albert Cohen (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 18\u201339. isbn:978-3-642-54807-9","key":"e_1_3_2_1_37_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1145\/3371038"},{"doi-asserted-by":"publisher","unstructured":"Harishankar Vishwanathan Matan Shachnai Srinivas Narayana and Santosh Nagarakatte. 2022. Sound Precise and Fast Abstract Interpretation with Tristate Numbers. In CGO. IEEE Press Virtual Event Republic of Korea. 254\u2013265. isbn:9781665405843 https:\/\/doi.org\/10.1109\/CGO53902.2022.9741267 10.1109\/CGO53902.2022.9741267","key":"e_1_3_2_1_39_1","DOI":"10.1109\/CGO53902.2022.9741267"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1007\/978-3-031-37709-9_12"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1145\/2647508.2647517"}],"event":{"sponsor":["SIGPLAN SIGPLAN Programming Languages","SIGMICRO SIGMICRO Microarchitecture","IEEE Computer Society IEEE Computer Society"],"acronym":"CGO '25","name":"CGO '25: 23rd ACM\/IEEE International Symposium on Code Generation and Optimization","location":"Las Vegas NV USA"},"container-title":["Proceedings of the 23rd ACM\/IEEE International Symposium on Code Generation and Optimization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696443.3708923","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:13Z","timestamp":1750295413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696443.3708923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":41,"alternative-id":["10.1145\/3696443.3708923","10.1145\/3696443"],"URL":"https:\/\/doi.org\/10.1145\/3696443.3708923","relation":{},"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"2025-03-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}