Lune

POPL2024Top-tier venue

An Iris Instance for Verifying CompCert C Programs

William Mansky, Ke Du

Abstract

Iris is a generic separation logic framework that has been instantiated to reason about a wide range of programming languages and language features. Most Iris instances are defined on simple core calculi, but by connecting Iris to new or existing formal semantics for practical languages, we can also use it to reason about real programs. In this paper we develop an Iris instance based on CompCert, the verified C compiler, allowing us to prove correctness of C programs under the same semantics we use to compile and run them. We take inspiration from the Verified Software Toolchain (VST), a prior separation logic for CompCert C, and reimplement the program logic of VST in Iris. Unlike most Iris instances, this involves both a new model of resources for CompCert memories, and a new definition of weakest preconditions/Hoare triples, as the Iris defaults for both of these cannot be applied to CompCert as is. Ultimately, we obtain a complete program logic for CompCert C within Iris, and we reconstruct enough of VST’s top-level automation to prove correctness of simple C programs.

Ask Lune

Know this paper in minutes, not an afternoon.

Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.

5 top-tier papers have cited it since. Know what they found before your reviewers do.

Questions to start from

Lune can draw on

the full paper · the top-tier papers that cite it · related work

Get the answer

Free to start. No credit card required.

Lineage

  • Archmage and CompCertCast: End-to-End Verification Supporting Integer-Pointer Casting cites RefinedC: automating the foundational verification of C code with refined ownership types
  • Transfinite Iris: resolving an existential dilemma of step-indexed separation logic cites RustBelt meets relaxed memory
  • Generically Automating Separation Logic by Functors, Homomorphisms, and Modules cites RustBelt meets relaxed memory
  • Generically Automating Separation Logic by Functors, Homomorphisms, and Modules cites RefinedC: automating the foundational verification of C code with refined ownership types
  • Generically Automating Separation Logic by Functors, Homomorphisms, and Modules cites Diaframe: automated verification of fine-grained concurrent programs in Iris
  • RefinedC: automating the foundational verification of C code with refined ownership types cites RustBelt meets relaxed memory
  • RefinedC: automating the foundational verification of C code with refined ownership types cites Transfinite Iris: resolving an existential dilemma of step-indexed separation logic
  • Raven: An SMT-Based Concurrency Verifier cites Diaframe: automated verification of fine-grained concurrent programs in Iris
  • Program Logics à la Carte cites RefinedC: automating the foundational verification of C code with refined ownership types
  • Diaframe: automated verification of fine-grained concurrent programs in Iris cites RustBelt meets relaxed memory
  • Diaframe: automated verification of fine-grained concurrent programs in Iris cites RefinedC: automating the foundational verification of C code with refined ownership types
  • PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed Programs cites Transfinite Iris: resolving an existential dilemma of step-indexed separation logic
Builds onCited byLeft to right by year; the more cited, the higher.

Cited by top-tier papers5

  1. PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed ProgramsGabriel Ebner, Guido Martínez, Aseem Rastogi, Thibault Dardinier et al.PLDI 2025 · 8 citations
  2. Program Logics à la CarteMax Vistrup, Michael Sammler, Ralf JungPOPL 2025 · 4 citations
  3. Archmage and CompCertCast: End-to-End Verification Supporting Integer-Pointer CastingYonghyun Kim, Minki Cho, Jaehyung Lee, Jinwoo Kim et al.POPL 2025 · 1 citation
  4. Raven: An SMT-Based Concurrency VerifierEkanshdeep Gupta, Nisarg Patel, Thomas WiesCAV 2025 · 1 citation
  5. Generically Automating Separation Logic by Functors, Homomorphisms, and ModulesQiyuan Xu, David Sanán, Zhe Hou, Xiaokun Luan et al.POPL 2025

Builds on8

  1. RefinedC: automating the foundational verification of C code with refined ownership typesMichael Sammler, Rodolphe Lepigre, Robbert Krebbers, Kayvan Memarian et al.PLDI 2021 · 83 citations
  2. RustBelt meets relaxed memoryHoang-Hai Dang, Jacques-Henri Jourdan, Jan-Oliver Kaiser, Derek DreyerPOPL 2020 · 68 citations
  3. Transfinite Iris: resolving an existential dilemma of step-indexed separation logicSimon Spies, Lennard Gäher, Daniel Gratzer, Joseph Tassarotti et al.PLDI 2021 · 32 citations
  4. Two Mechanisations of WebAssembly 1.0Conrad Watt, Xiaojia Rao, Jean Pichon-Pharabod, Martin Bodin et al.FM 2021 · 32 citations
  5. Diaframe: automated verification of fine-grained concurrent programs in IrisIke Mulder, Robbert Krebbers, Herman GeuversPLDI 2022 · 27 citations

Related papers

  1. CompCertELF: verified separate compilation of C programs into ELF object filesYuting Wang, Xiangzhe Xu, Pierre Wilke, Zhong ShaoOOPSLA 2020 · 26 citations
  2. Beyond Backtracking: Connections in Fine-Grained Concurrent Separation LogicIke Mulder, Lukasz Czajka, Robbert KrebbersPLDI 2023 · 2 citations
  3. VST-A: A Foundationally Sound Annotation VerifierLitao Zhou, Jianxing Qin, Qinshi Wang, Andrew W. Appel et al.POPL 2024 · 12 citations
  4. Spirea: A Mechanized Concurrent Separation Logic for Weak Persistent MemorySimon Friis Vindum, Lars BirkedalOOPSLA 2023 · 6 citations
  5. Melocoton: A Program Logic for Verified Interoperability Between OCaml and CArmaël Guéneau, Johannes Hostert, Simon Spies, Michael Sammler et al.OOPSLA 2023 · 10 citations
Dusk over the sea between two cliffs drawn in fine vertical lines