VeriCHERI: Exhaustive Formal Security Verification of CHERI at the RTL
<|reference_start|>VeriCHERI: Exhaustive Formal Security Verification of CHERI at the RTL: Protecting data in memory from attackers continues to be a concern in computing systems. CHERI is a promising approach to achieve such protection, by providing and enforcing fine-grained memory protection directly in the hardware. Creating trust for the entire system stack, however, requires a gap-free verification of CHERI's hardware-based protection mechanisms. Existing verification methods for CHERI target the abstract ISA model rather than the underlying hardware implementation. Fully ensuring the CHERI security guarantees for a concrete RTL implementation is a challenge in previous flows and demands high manual efforts. This paper presents VeriCHERI, a novel approach to security verification. It is conceptionally different from previous works in that it does not require any ISA specification. Instead of checking compliance with a golden ISA model, we check against well-established global security objectives of confidentiality and integrity. Fully covering these objectives, VeriCHERI uses as few as four unbounded properties to exhaustively prove or disprove any vulnerability. We demonstrate the effectiveness and scalability of VeriCHERI on a RISC-V based processor implementing a CHERI variant.<|reference_end|>
@article{antón2024vericheri:,
    title={VeriCHERI: Exhaustive Formal Security Verification of CHERI at the RTL},
    author={Anna Lena Duque Ant'on, Johannes M"uller, Philipp Schmitz, Tobias
  Jauch, Alex Wezel, Lucas Deutschmann, Mohammad Rahmani Fadiheh, Dominik
  Stoffel and Wolfgang Kunz},
    journal={arXiv preprint arXiv:2407.18679},
    year={2024},
    doi={10.1145/3676536.3676841},
    archivePrefix={arXiv},
    eprint={2407.18679},
    primaryClass={cs.CR}
}