Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement
Open Access
- 2 January 2024
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 8 (POPL) , 241-272
Abstract
Expressive state-of-the-art separation logics rely on step-indexing to model semantically complex features and to support modular reasoning about imperative higher-order concurrent and distributed programs. Stepindexing comes, however, with an inherent cost: it restricts the adequacy theorem of program logics to a fairly simple class of safety properties. In this paper, we explore if and how intensional refinement is a viable methodology for strengthening higher-order concurrent (and distributed) separation logic to prove non-trivial safety and liveness properties. Specifically, we introduce Trillium, a language-agnostic separation logic framework for showing intensional refinement relations between traces of a program and a model. We instantiate Trillium with a concurrent language and develop Fairis, a concurrent separation logic, that we use to show liveness properties of concurrent programs under fair scheduling assumptions through a fair liveness-preserving refinement of a model. We also instantiate Trillium with a distributed language and obtain an extension of Aneris, a distributed separation logic, which we use to show refinement relations between distributed systems and TLA + models.Keywords
All Related Versions
Funding Information
- Villum Foundation (25804)
- European Research Council (101003349)
This publication has 33 references indexed in Scilit:
- IronFleetCommunications of the ACM, 2017
- A Higher-Order Logic for Concurrent Termination-Preserving Refinement2017
- Interactive proofs in higher-order concurrent separation logic2017
- A relational model of types-and-effects in higher-order concurrent separation logic2017
- Formal Verification of Multi-Paxos for Distributed Consensus2016
- A program logic for concurrent objects under fair scheduling2016
- Iris2015
- Eventually consistentCommunications of the ACM, 2009
- The part-time parliamentACM Transactions on Computer Systems, 1998
- Notes on data base operating systems1978