{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T01:17:50Z","timestamp":1768699070090,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,9,10]],"date-time":"2023-09-10T00:00:00Z","timestamp":1694304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-2236966"],"award-info":[{"award-number":["CNS-2236966"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,9,10]]},"DOI":"10.1145\/3609021.3609297","type":"proceedings-article","created":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T17:13:20Z","timestamp":1692378800000},"page":"49-55","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Enabling BPF Runtime policies for better BPF management"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5160-0362","authenticated-orcid":false,"given":"Raj","family":"Sahu","sequence":"first","affiliation":[{"name":"Virginia Tech, Blacksburg, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1537-0525","authenticated-orcid":false,"given":"Dan","family":"Williams","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,9,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"BPF performance analysis at netflix. https:\/\/d1.awsstatic.com\/events\/reinvent\/2019\/REPEAT_1_BPF_performance_analysis_at_Netflix_OPN303-R1.pdf. Accessed: 2023-06-08.  BPF performance analysis at netflix. https:\/\/d1.awsstatic.com\/events\/reinvent\/2019\/REPEAT_1_BPF_performance_analysis_at_Netflix_OPN303-R1.pdf. Accessed: 2023-06-08."},{"key":"e_1_3_2_1_2_1","unstructured":"Open-sourcing katran a scalable network load balancer. https:\/\/engineering.fb.com\/2018\/05\/22\/open-source\/open-sourcing-katran-a-scalable-network-load-balancer\/. Accessed: 2023-06-08.  Open-sourcing katran a scalable network load balancer. https:\/\/engineering.fb.com\/2018\/05\/22\/open-source\/open-sourcing-katran-a-scalable-network-load-balancer\/. Accessed: 2023-06-08."},{"key":"e_1_3_2_1_3_1","unstructured":"Bpftrace. https:\/\/bpftrace.org\/. Accessed: 2023-06-08.  Bpftrace. https:\/\/bpftrace.org\/. Accessed: 2023-06-08."},{"key":"e_1_3_2_1_4_1","unstructured":"Tertragon:eBPF-based security observability and runtime enforcement. https:\/\/github.com\/cilium\/tetragon. Accessed: 2023-06-08.  Tertragon:eBPF-based security observability and runtime enforcement. https:\/\/github.com\/cilium\/tetragon. Accessed: 2023-06-08."},{"key":"e_1_3_2_1_5_1","unstructured":"bpfd. https:\/\/bpfd.netlify.app\/. Accessed: 2023-05-22.  bpfd. https:\/\/bpfd.netlify.app\/. Accessed: 2023-05-22."},{"key":"e_1_3_2_1_6_1","unstructured":"l3afd. https:\/\/github.com\/l3af-project\/l3afd. Accessed: 2023-05-25.  l3afd. https:\/\/github.com\/l3af-project\/l3afd. Accessed: 2023-05-25."},{"key":"e_1_3_2_1_7_1","first-page":"283","volume-title":"Proceedings of the Seventeenth European Conference on Computer Systems","author":"Kuo Hsuan-Chi","year":"2022","unstructured":"Hsuan-Chi Kuo , Kai-Hsun Chen , Yicheng Lu , Dan Williams , Sibin Mohan , and Tianyin Xu . Verified programs can party: optimizing kernel extensions via post-verification merging . In Proceedings of the Seventeenth European Conference on Computer Systems , pages 283 -- 299 , 2022 . Hsuan-Chi Kuo, Kai-Hsun Chen, Yicheng Lu, Dan Williams, Sibin Mohan, and Tianyin Xu. Verified programs can party: optimizing kernel extensions via post-verification merging. In Proceedings of the Seventeenth European Conference on Computer Systems, pages 283--299, 2022."},{"key":"e_1_3_2_1_8_1","first-page":"517","volume-title":"16th USENIX Symposium on Networked Systems Design and Implementation (NSD1 19)","author":"Iyer Rishabh","year":"2019","unstructured":"Rishabh Iyer , Luis Pedrosa , Arseniy Zaostrovnykh , Solal Pirelli , Katerina Argyraki , and George Candea . Performance contracts for software network functions . In 16th USENIX Symposium on Networked Systems Design and Implementation (NSD1 19) , pages 517 -- 530 , 2019 . Rishabh Iyer, Luis Pedrosa, Arseniy Zaostrovnykh, Solal Pirelli, Katerina Argyraki, and George Candea. Performance contracts for software network functions. In 16th USENIX Symposium on Networked Systems Design and Implementation (NSD1 19), pages 517--530, 2019."},{"key":"e_1_3_2_1_9_1","first-page":"567","volume-title":"19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22)","author":"Iyer Rishabh","year":"2022","unstructured":"Rishabh Iyer , Katerina Argyraki , and George Candea . Performance interfaces for network functions . In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22) , pages 567 -- 584 , 2022 . Rishabh Iyer, Katerina Argyraki, and George Candea. Performance interfaces for network functions. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22), pages 567--584, 2022."},{"key":"e_1_3_2_1_10_1","unstructured":"Toward signed BPF programs. https:\/\/lwn.net\/Articles\/853489\/. Accessed: 2023-06-02.  Toward signed BPF programs. https:\/\/lwn.net\/Articles\/853489\/. Accessed: 2023-06-02."},{"key":"e_1_3_2_1_11_1","unstructured":"BPF architecture. https:\/\/docs.cilium.io\/en\/latest\/bpf\/architecture\/#instruction-set. Accessed: 2023-06-08.  BPF architecture. https:\/\/docs.cilium.io\/en\/latest\/bpf\/architecture\/#instruction-set. Accessed: 2023-06-08."},{"key":"e_1_3_2_1_12_1","unstructured":"BPF\n  : introduce function calls. https:\/\/lwn.net\/Articles\/741773\/. Accessed: 2023-06-07.  BPF: introduce function calls. https:\/\/lwn.net\/Articles\/741773\/. Accessed: 2023-06-07."},{"key":"e_1_3_2_1_13_1","unstructured":"BPF open-coded iterators. https:\/\/lwn.net\/Articles\/925751\/. Accessed: 2023-06-03.  BPF open-coded iterators. https:\/\/lwn.net\/Articles\/925751\/. Accessed: 2023-06-03."},{"key":"e_1_3_2_1_14_1","unstructured":"CVE-2023-2163. https:\/\/git.kernel.org\/pub\/scm\/linux\/kernel\/git\/torvalds\/linux.git\/commit\/?id=71b547f561247897a0a14f3082730156c0533fed. Accessed: 2023-06-02.  CVE-2023-2163. https:\/\/git.kernel.org\/pub\/scm\/linux\/kernel\/git\/torvalds\/linux.git\/commit\/?id=71b547f561247897a0a14f3082730156c0533fed. Accessed: 2023-06-02."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230573"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387554"},{"key":"e_1_3_2_1_17_1","unstructured":"A zoological guide to kernel data structures. https:\/\/blogs.oracle.com\/linux\/post\/a-zoological-guide-to-kernel-data-structures. Accessed: 2023-07-06.  A zoological guide to kernel data structures. https:\/\/blogs.oracle.com\/linux\/post\/a-zoological-guide-to-kernel-data-structures. Accessed: 2023-07-06."},{"key":"e_1_3_2_1_18_1","first-page":"141","volume-title":"9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12)","author":"Dobrescu Mihai","year":"2012","unstructured":"Mihai Dobrescu , Katerina Argyraki , and Sylvia Ratnasamy . Toward predictable performance in software {Packet-Processing} platforms . In 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12) , pages 141 -- 154 , 2012 . Mihai Dobrescu, Katerina Argyraki, and Sylvia Ratnasamy. Toward predictable performance in software {Packet-Processing} platforms. In 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12), pages 141--154, 2012."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405868"},{"key":"e_1_3_2_1_20_1","volume-title":"The worst-case execution-time problem---overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems (TECS), 7(3):1--53","author":"Wilhelm Reinhard","year":"2008","unstructured":"Reinhard Wilhelm , Jakob Engblom , Andreas Ermedahl , Niklas Holsti , Stephan Thesing , David Whalley , Guillem Bernat , Christian Ferdinand , Reinhold Heckmann , Tulika Mitra , The worst-case execution-time problem---overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems (TECS), 7(3):1--53 , 2008 . Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Tulika Mitra, et al. The worst-case execution-time problem---overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems (TECS), 7(3):1--53, 2008."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2051749"},{"key":"e_1_3_2_1_22_1","volume-title":"A survey of hard real-time scheduling for multiprocessor systems. ACM computing surveys (CSUR), 43(4):1--44","author":"Davis Robert I","year":"2011","unstructured":"Robert I Davis and Alan Burns . A survey of hard real-time scheduling for multiprocessor systems. ACM computing surveys (CSUR), 43(4):1--44 , 2011 . Robert I Davis and Alan Burns. A survey of hard real-time scheduling for multiprocessor systems. ACM computing surveys (CSUR), 43(4):1--44, 2011."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/EMRTS.2001.934029","volume-title":"Proceedings 13th Euromicro Conference on Real-Time Systems","author":"Colin Antoine","year":"2001","unstructured":"Antoine Colin and Isabelle Puaut . Worst-case execution time analysis of the rtems real-time operating system . In Proceedings 13th Euromicro Conference on Real-Time Systems , pages 191 -- 198 . IEEE, 2001 . Antoine Colin and Isabelle Puaut. Worst-case execution time analysis of the rtems real-time operating system. In Proceedings 13th Euromicro Conference on Real-Time Systems, pages 191--198. IEEE, 2001."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086228.1086248"},{"key":"e_1_3_2_1_25_1","first-page":"77","article-title":"Fully automatic, parametric worst-case execution time analysis","volume":"3","author":"Lisper Bj\u00f6rn","year":"2003","unstructured":"Bj\u00f6rn Lisper . Fully automatic, parametric worst-case execution time analysis . WCET , 3 : 77 -- 80 , 2003 . Bj\u00f6rn Lisper. Fully automatic, parametric worst-case execution time analysis. WCET, 3:77--80, 2003.","journal-title":"WCET"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2009.55"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001)","author":"Edgar Stewart","unstructured":"Stewart Edgar and Alan Burns . Statistical analysis of wcet for scheduling . In Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No. 01PR1420), pages 215--224. IEEE, 2001. Stewart Edgar and Alan Burns. Statistical analysis of wcet for scheduling. In Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001)(Cat. No. 01PR1420), pages 215--224. IEEE, 2001."},{"key":"e_1_3_2_1_28_1","volume-title":"9th international workshop on worst-case execution time analysis (WCET'09)","author":"Hansen Jeffery","year":"2009","unstructured":"Jeffery Hansen , Scott Hissam , and Gabriel A Moreno . Statistical-based wcet estimation and validation . In 9th international workshop on worst-case execution time analysis (WCET'09) . Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik , 2009 . Jeffery Hansen, Scott Hissam, and Gabriel A Moreno. Statistical-based wcet estimation and validation. In 9th international workshop on worst-case execution time analysis (WCET'09). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2009."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038617.2038619"},{"key":"e_1_3_2_1_30_1","volume-title":"A survey of timing verification techniques for multi-core real-time systems. ACM Computing Surveys (CSUR), 52(3):1--38","author":"Maiza Claire","year":"2019","unstructured":"Claire Maiza , Hamza Rihani , Juan M Rivas , Jo\u00ebl Goossens , Sebastian Altmeyer , and Robert I Davis . A survey of timing verification techniques for multi-core real-time systems. ACM Computing Surveys (CSUR), 52(3):1--38 , 2019 . Claire Maiza, Hamza Rihani, Juan M Rivas, Jo\u00ebl Goossens, Sebastian Altmeyer, and Robert I Davis. A survey of timing verification techniques for multi-core real-time systems. ACM Computing Surveys (CSUR), 52(3):1--38, 2019."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236039"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3364452.3364455"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978428"},{"key":"e_1_3_2_1_34_1","volume-title":"19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019","author":"K\u00e4stner Daniel","year":"2019","unstructured":"Daniel K\u00e4stner , Markus Pister , Simon Wegener , and Christian Ferdinand . Timeweaver : A tool for hybrid worst-case execution time analysis . In 19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019 ). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik , 2019 . Daniel K\u00e4stner, Markus Pister, Simon Wegener, and Christian Ferdinand. Timeweaver: A tool for hybrid worst-case execution time analysis. In 19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/REAL.2002.1181582","volume-title":"23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002.","author":"Bernat G.","year":"2002","unstructured":"G. Bernat , A. Colin , and S.M. Petters . Wcet analysis of probabilistic hard real-time systems . In 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002. , pages 279 -- 288 , 2002 . G. Bernat, A. Colin, and S.M. Petters. Wcet analysis of probabilistic hard real-time systems. In 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002., pages 279--288, 2002."},{"issue":"3","key":"e_1_3_2_1_36_1","article-title":"Effective worst-case execution time analysis of do178c level a software","volume":"36","author":"Law Stephen","year":"2015","unstructured":"Stephen Law , Mike Bennett , Stuart Hutchesson , Ivan Ellis , Guillem Bernat , Antoine Colin , and Andrew Coombes . Effective worst-case execution time analysis of do178c level a software . Ada User Journal , 36 ( 3 ), 2015 . Stephen Law, Mike Bennett, Stuart Hutchesson, Ivan Ellis, Guillem Bernat, Antoine Colin, and Andrew Coombes. Effective worst-case execution time analysis of do178c level a software. Ada User Journal, 36(3), 2015.","journal-title":"Ada User Journal"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEUS.2005.12"},{"key":"e_1_3_2_1_38_1","volume-title":"Using measurements as a complement to static worst-case execution time analysis. Intelligent Systems at the Service of Mankind, 2(8):20","author":"Kirner Raimund","year":"2005","unstructured":"Raimund Kirner , Ingomar Wenzel , Bernhard Rieder , and Peter Puschner . Using measurements as a complement to static worst-case execution time analysis. Intelligent Systems at the Service of Mankind, 2(8):20 , 2005 . Raimund Kirner, Ingomar Wenzel, Bernhard Rieder, and Peter Puschner. Using measurements as a complement to static worst-case execution time analysis. Intelligent Systems at the Service of Mankind, 2(8):20, 2005."}],"event":{"name":"eBPF '23: 1st Workshop on eBPF and Kernel Extensions","location":"New York NY USA","acronym":"eBPF '23","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 1st Workshop on eBPF and Kernel Extensions"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609021.3609297","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:57Z","timestamp":1750182537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609021.3609297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,10]]},"references-count":38,"alternative-id":["10.1145\/3609021.3609297","10.1145\/3609021"],"URL":"https:\/\/doi.org\/10.1145\/3609021.3609297","relation":{},"subject":[],"published":{"date-parts":[[2023,9,10]]},"assertion":[{"value":"2023-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}