{"citation":{"mla":"Zhu, Fengmin, et al. “BFF: Foundational and Automated Verification of Bitfield-Manipulating Programs.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 6, no. OOPSLA2, Association for Computing Machinery, 2022, pp. 1613–38, doi:<a href=\"https://doi.org/10.1145/3563345\">10.1145/3563345</a>.","apa":"Zhu, F., Sammler, M. J., Lepigre, R., Dreyer, D., &#38; Garg, D. (2022). BFF: Foundational and automated verification of bitfield-manipulating programs. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3563345\">https://doi.org/10.1145/3563345</a>","ama":"Zhu F, Sammler MJ, Lepigre R, Dreyer D, Garg D. BFF: Foundational and automated verification of bitfield-manipulating programs. <i>Proceedings of the ACM on Programming Languages</i>. 2022;6(OOPSLA2):1613-1638. doi:<a href=\"https://doi.org/10.1145/3563345\">10.1145/3563345</a>","chicago":"Zhu, Fengmin, Michael Joachim Sammler, Rodolphe Lepigre, Derek Dreyer, and Deepak Garg. “BFF: Foundational and Automated Verification of Bitfield-Manipulating Programs.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3563345\">https://doi.org/10.1145/3563345</a>.","short":"F. Zhu, M.J. Sammler, R. Lepigre, D. Dreyer, D. Garg, Proceedings of the ACM on Programming Languages 6 (2022) 1613–1638.","ieee":"F. Zhu, M. J. Sammler, R. Lepigre, D. Dreyer, and D. Garg, “BFF: Foundational and automated verification of bitfield-manipulating programs,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 6, no. OOPSLA2. Association for Computing Machinery, pp. 1613–1638, 2022.","ista":"Zhu F, Sammler MJ, Lepigre R, Dreyer D, Garg D. 2022. BFF: Foundational and automated verification of bitfield-manipulating programs. Proceedings of the ACM on Programming Languages. 6(OOPSLA2), 1613–1638."},"date_updated":"2024-09-10T09:49:18Z","oa_version":"Published Version","type":"journal_article","publisher":"Association for Computing Machinery","author":[{"last_name":"Zhu","full_name":"Zhu, Fengmin","first_name":"Fengmin"},{"last_name":"Sammler","id":"510d3901-2a03-11ee-914d-d9ae9011f0a7","full_name":"Sammler, Michael Joachim","first_name":"Michael Joachim"},{"last_name":"Lepigre","first_name":"Rodolphe","full_name":"Lepigre, Rodolphe"},{"first_name":"Derek","full_name":"Dreyer, Derek","last_name":"Dreyer"},{"full_name":"Garg, Deepak","first_name":"Deepak","last_name":"Garg"}],"page":"1613-1638","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-05T08:27:17Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3563345"}],"day":"31","status":"public","language":[{"iso":"eng"}],"issue":"OOPSLA2","date_published":"2022-10-31T00:00:00Z","article_type":"original","intvolume":"         6","abstract":[{"text":"Low-level systems code often needs to interact with data, such as page table entries or network packet headers, in which multiple pieces of information are packaged together as bitfield components of a single machine integer and accessed via bitfield manipulations (e.g., shifts and masking). Most existing approaches to verifying such code employ SMT solvers, instantiated with theories for bit vector reasoning: these provide a powerful hammer, but also significantly increase the trusted computing base of the verification toolchain.\r\nIn this work, we propose an alternative approach to the verification of bitfield-manipulating systems code, which we call BFF. Building on the RefinedC framework, BFF is not only highly automated (as SMT-based approaches are) but also foundational---i.e., it produces a machine-checked proof of program correctness against a formal semantics for C programs, fully mechanized in Coq. Unlike SMT-based approaches, we do not try to solve the general problem of arbitrary bit vector reasoning, but rather observe that real systems code typically accesses bitfields using simple, well-understood programming patterns: the layout of a bit vector is known up front, and its bitfields are accessed in predictable ways through a handful of bitwise operations involving bit masks. Correspondingly, we center our approach around the concept of a structured bit vector---i.e., a bit vector with a known bitfield layout---which we use to drive simple and predictable automation. We validate the BFF approach by verifying a range of bitfield-manipulating C functions drawn from real systems code, including page table manipulation code from the Linux kernel and the pKVM hypervisor.","lang":"eng"}],"publication_status":"published","article_processing_charge":"No","_id":"17501","extern":"1","volume":6,"title":"BFF: Foundational and automated verification of bitfield-manipulating programs","oa":1,"scopus_import":"1","month":"10","quality_controlled":"1","doi":"10.1145/3563345","publication_identifier":{"issn":["2475-1421"]},"publication":"Proceedings of the ACM on Programming Languages","year":"2022"}