Iris from the ground up: A modular foundation for higher-order concurrent separation logic-Reference-Cited by-同舟云学术

Iris from the ground up: A modular foundation for higher-order concurrent separation logic

Published:2018 Issue: Volume:28 Page:
ISSN:0956-7968
Container-title:Journal of Functional Programming
language:en
Short-container-title:J. Funct. Prog.

Author:

JUNG RALF,KREBBERS ROBBERT,JOURDAN JACQUES-HENRI,BIZJAK ALEŠ,BIRKEDAL LARS,DREYER DEREK

Abstract

Iris is a framework for higher-order concurrent separation logic, which has been implemented in the Coq proof assistant and deployed very effectively in a wide variety of verification projects. Iris was designed with the express goal of simplifying and consolidating the foundations of modern separation logics, but it has evolved over time, and the design and semantic foundations of Iris itself have yet to be fully written down and explained together properly in one place. Here, we attempt to fill this gap, presenting a reasonably complete picture of the latest version of Iris (version 3.1), from first principles and in one coherent narrative.

Publisher

Cambridge University Press (CUP)

Subject

Software

Reference76 articles.

1. Vafeiadis, Viktor , & Parkinson, Matthew J. (2007). A marriage of rely/guarantee and separation logic. Pages 256–271 of: CONCUR. LNCS, vol. 4703.

2. A logical relation for monadic encapsulation of state: Proving contextual equivalences in the presence of runST;Timany;PACMPL,2018

3. Timany, Amin , & Birkedal, Lars . (2018). Mechanized relational verification of concurrent programs with continuations. Draft.

4. Tassarotti, Joseph , Jung, Ralf , & Harper, Robert . (2017). A higher-order logic for concurrent termination-preserving refinement. Pages 909–936 of: ESOP. LNCS, vol. 10201.

5. Robust and compositional verification of object capability patterns;Swasey;PACMPL,2017

Cited by 220 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Practical Deductive Verification of OCaml Programs;Lecture Notes in Computer Science;2024-09-13

2. Staged Specification Logic for Verifying Higher-Order Imperative Programs;Lecture Notes in Computer Science;2024-09-11

3. Higher-Order unification for free!: Reusing the meta-language unification for the object language;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09

4. Intrinsically Typed Syntax, a Logical Relation, and the Scourge of the Transfer Lemma;Proceedings of the 9th ACM SIGPLAN International Workshop on Type-Driven Development;2024-08-28

5. A Two-Phase Infinite/Finite Low-Level Memory Model: Reconciling Integer–Pointer Casts, Finite Space, and undef at the LLVM IR Level of Abstraction;Proceedings of the ACM on Programming Languages;2024-08-15