Verifying Secure Speculation in Isabelle/HOL

被引:3
|
作者
Griffin, Matt [1 ]
Dongol, Brijesh [1 ]
机构
[1] Univ Surrey, Guildford, Surrey, England
来源
FORMAL METHODS, FM 2021 | 2021年 / 13047卷
基金
英国工程与自然科学研究理事会;
关键词
Isabelle/HOL; Secure speculation; Formal verification; Spectre; Transient execution vulnerabilities; Hyperproperties;
D O I
10.1007/978-3-030-90870-6_3
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Secure speculation is an information flow security hyperproperty that prevents transient execution attacks such as Spectre, Meltdown and Foreshadow. Generic compiler mitigations for secure speculation are known to be insufficient for eliminating vulnerabilities. Moreover, these mitigation techniques often overprescribe speculative fences, causing the performance of the programs to suffer. Recently Cheang et al. have developed an operational semantics of program execution capable of characterising speculative executions as well as a new class of information flow hyperproperties named TPOD that ensure secure speculation. This paper presents a framework for verifying TPOD using the Isabelle/HOL proof assistant by encoding the operational semantics of Cheang et al. We provide translation tools for automatically generating the required Isabelle/HOL theory templates from a C-like program syntax, which speeds up verification. Our framework is capable of proving the existence of vulnerabilities and correctness of secure speculation. We exemplify our framework by proving the existence of secure speculation bugs in 15 victim functions for the MSVC compiler as well as correctness of some proposed fixes.
引用
收藏
页码:43 / 60
页数:18
相关论文
共 50 条
  • [1] Towards Verifying GOAL Agents in Isabelle/HOL
    Jensert, Alexander Birch
    [J]. ICAART: PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE - VOL 1, 2021, : 345 - 352
  • [2] Verifying Term Graph Optimizations using Isabelle/HOL
    Webb, Brae J.
    Hayes, Ian J.
    Utting, Mark
    [J]. PROCEEDINGS OF THE 12TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON CERTIFIED PROGRAMS AND PROOFS, CPP 2023, 2023, : 320 - 333
  • [3] Verifying Feedforward Neural Networks for Classification in Isabelle/HOL
    Brucker, Achim D.
    Stell, Amy
    [J]. FORMAL METHODS, FM 2023, 2023, 14000 : 427 - 444
  • [4] Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL
    Bottesch, Ralph
    Haslbeck, Max W.
    Reynaud, Alban
    Thiemann, Rene
    [J]. NASA FORMAL METHODS (NFM 2020), 2020, 12229 : 233 - 250
  • [5] Verifying an Incremental Theory Solver for Linear Arithmetic in Isabelle/HOL
    Bottesch, Ralph
    Haslbeck, Max W.
    Thiemann, Rene
    [J]. FRONTIERS OF COMBINING SYSTEMS (FROCOS 2019), 2019, 11715 : 223 - 239
  • [6] Programming and verifying a declarative first-order prover in Isabelle/HOL
    Jensen, Alexander Birch
    Larsen, John Bruntse
    Schlichtkrull, Anders
    Villadsen, Jorgen
    [J]. AI COMMUNICATIONS, 2018, 31 (03) : 281 - 299
  • [7] Importing HOL into Isabelle/HOL
    Obua, Steven
    Skalberg, Sebastian
    [J]. AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 298 - 302
  • [8] An interpretation of Isabelle/HOL in HOL Light
    McLaughlin, Sean
    [J]. AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 192 - 204
  • [9] Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL
    From, Asta Halkjaer
    Jacobsen, Frederik Krogsdal
    [J]. JOURNAL OF AUTOMATED REASONING, 2024, 68 (03)
  • [10] Safety and Conservativity of Definitions in HOL and Isabelle/HOL
    Kuncar, Ondrej
    Popescu, Andrei
    [J]. PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2018, 2 (POPL):