Reasoning in Higher-Order Concurrent Separation Logic
summary
Iris program logic is a higher-order concurrent separation logic that produces a tailored program logic from an operational semantics and an adequacy theorem that yields standard safety and partial functional correctness. It combines higher-order propositions, guarded recursion and step-indexing, separating conjunction with user-defined ghost resources (PCMs) and an update modality. Examples include a logical-relations model for recursive types and references built inside Iris, and a verified concurrent example using an invariant plus ghost counters to prove the final value is exactly three. Proofs are mechanized in Coq with an interactive proof mode.
AI-written summary · about