Cosmo: a concurrent separation logic for multicore OCaml

Author:

Mével Glen1,Jourdan Jacques-Henri2,Pottier François3

Affiliation:

1. Inria, France / University of Paris-Saclay, France / CNRS, France / LRI, France

2. University of Paris-Saclay, France / CNRS, France / LRI, France

3. Inria, France

Abstract

Multicore OCaml extends OCaml with support for shared-memory concurrency. It is equipped with a weak memory model, for which an operational semantics has been published. This begs the question: what reasoning rules can one rely upon while writing or verifying Multicore OCaml code? To answer it, we instantiate Iris, a modern descendant of Concurrent Separation Logic, for Multicore OCaml. This yields a low-level program logic whose reasoning rules expose the details of the memory model. On top of it, we build a higher-level logic, Cosmo, which trades off some expressive power in return for a simple set of reasoning rules that allow accessing nonatomic locations in a data-race-free manner, exploiting the sequentially-consistent behavior of atomic locations, and exploiting the release/acquire behavior of atomic locations. Cosmo allows both low-level reasoning, where the details of the Multicore OCaml memory model are apparent, and high-level reasoning, which is independent of this memory model. We illustrate this claim via a number of case studies: we verify several implementations of locks with respect to a classic, memory-model-independent specification. Thus, a coarse-grained application that uses locks as the sole means of synchronization can be verified in the Concurrent-Separation-Logic fragment of Cosmo, without any knowledge of the weak memory model.

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Reference34 articles.

1. Mathematizing C+ + concurrency;Batty Mark;Principles of Programming Languages (POPL).,2011

2. A formalization of Java’s concurrent access modes

3. Lars Birkedal and Aleš Bizjak. 2018. Lecture Notes on Iris: Higher-Order Concurrent Separation Logic. (Dec. 2018 ). https://iris-project. org/tutorial-pdfs/iris-lecture-notes.pdf Lectures notes. Lars Birkedal and Aleš Bizjak. 2018. Lecture Notes on Iris: Higher-Order Concurrent Separation Logic. (Dec. 2018 ). https://iris-project. org/tutorial-pdfs/iris-lecture-notes.pdf Lectures notes.

4. Permission accounting in separation logic;Bornat Richard;Principles of Programming Languages (POPL).,2005

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

1. A Proof Recipe for Linearizability in Relaxed Memory Separation Logic;Proceedings of the ACM on Programming Languages;2024-06-20

2. DisLog: A Separation Logic for Disentanglement;Proceedings of the ACM on Programming Languages;2024-01-05

3. Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic;Proceedings of the ACM on Programming Languages;2023-10-16

4. Melocoton: A Program Logic for Verified Interoperability Between OCaml and C;Proceedings of the ACM on Programming Languages;2023-10-16

5. Diaframe: automated verification of fine-grained concurrent programs in Iris;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3