A Formal CHERI-C Semantics for Verification
Preprint
Abstract
CHERI-C extends the C programming language by adding hardware capabilities, ensuring a certain degree of memory safety while remaining efficient. Capabilities can also be employed for higher-level security measures, such as software compartmentalization, that have to be used correctly to achieve the desired security guarantees. As the extension changes the semantics of C, new theories and tooling are required to reason about CHERI-C code and verify correctness. In this work, we present a formal memory model that provides a memory semantics for CHERI-C programs. We present a generalised theory with rich properties suitable for verification and potentially other types of analyses. Our theory is backed by an Isabelle/HOL formalisation that also generates an OCaml executable instance of the memory model. The verified and extracted code is then used to instantiate the parametric Gillian program analysis framework, with which we can perform concrete execution of CHERI-C programs. The tool can run a CHERI-C test suite, demonstrating the correctness of our tool, and catch a good class of safety violations that the CHERI hardware might miss.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Gillian, Part II: Real-World Verification for JavaScript and C2021
- Cornucopia: Temporal Safety for CHERI Heaps2020
- CHERI Concentrate: Practical Compressed CapabilitiesIEEE Transactions on Computers, 2019
- A Formal C Memory Model for Separation LogicJournal of Automated Reasoning, 2016
- Light-Weight Containers for Isabelle: Efficient, Extensible, NestableLecture Notes in Computer Science, 2013
- Data Refinement in Isabelle/HOL2013
- Mechanised Separation AlgebraLecture Notes in Computer Science, 2012
- A Precise Yet Efficient Memory Model For CElectronic Notes in Theoretical Computer Science, 2009
- Formal Verification of C Systems CodeJournal of Automated Reasoning, 2009
- Isabelle/HOL2002