Actris: session-type based reasoning in separation logic

Hinrichsen, Jonas Kastberg; Bengtson, Jesper; Krebbers, Robbert

doi:10.1145/3371074

Cited by 32 publications

(15 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, several program logics, most notably those that are built on top of the Iris framework [Bizjak et al 2019;Hinrichsen et al 2020;Jung et al 2018Jung et al , 2020Jung et al , 2015, the SteelCore framework [Swamy et al 2020], VST [Appel et al 2014], and also FCSL [Ley-Wild and Nanevski 2013;Nanevski et al 2014;Sergey et al 2015aSergey et al ,b, 2016, have allowed PCMs to be declared at the user level, and sometimes even constructed by means of a predetermined set of combinators.…”

Section: Related Workmentioning

confidence: 99%

On algebraic abstractions for concurrent separation logics

Farka

Nanevski

Banerjee

et al. 2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Concurrent separation logic is distinguished by transfer of state ownership upon parallel composition and framing. The algebraic structure that underpins ownership transfer is that of partial commutative monoids (PCMs). Extant research considers ownership transfer primarily from the logical perspective while comparatively less attention is drawn to the algebraic considerations. This paper provides an algebraic formalization of ownership transfer in concurrent separation logic by means of structure-preserving partial functions (i.e., morphisms) between PCMs, and an associated notion of separating relations. Morphisms of structures are a standard concept in algebra and category theory, but haven't seen ubiquitous use in separation logic before. Separating relations. are binary relations that generalize disjointness and characterize the inputs on which morphisms preserve structure. The two abstractions facilitate verification by enabling concise ways of writing specs, by providing abstract views of threads' states that are preserved under ownership transfer, and by enabling user-level construction of new PCMs out of existing ones.

show abstract

Section: Related Workmentioning

confidence: 99%

On algebraic abstractions for concurrent separation logics

Farka

Nanevski

Banerjee

et al. 2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Our socket protocol definitions are quite similar to the multi-party asynchronous session types with progress encoded by having suitable ghostassertions and using the magic wand. Actris [8] is a logic for session-type based reasoning about message-passing in actor-based languages.…”

Section: Related Workmentioning

confidence: 99%

Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems

Krogh-Jespersen

Timany

Ohlenbusch

et al. 2020

Programming Languages and Systems

View full text Add to dashboard Cite

Building network-connected programs and distributed systems is a powerful way to provide scalability and availability in a digital, always-connected era. However, with great power comes great complexity. Reasoning about distributed systems is well-known to be difficult. In this paper we present Aneris, a novel framework based on separation logic supporting modular, node-local reasoning about concurrent and distributed systems. The logic is higher-order, concurrent, with higherorder store and network sockets, and is fully mechanized in the Coq proof assistant. We use our framework to verify an implementation of a load balancer that uses multi-threading to distribute load amongst multiple servers and an implementation of the two-phase-commit protocol with a replicated logging service as a client. The two examples certify that Aneris is well-suited for both horizontal and vertical modular reasoning.

show abstract

“…Embedding session types in CSL has also been investigated beforeÐthe Actris system embedded in Iris explores this in depth (Hinrichsen et al 2019). Our channel types explore a similar direction, though we only scratch the surface, in that as a proof concept of the expressiveness of the underlying logic, we only give an encoding for synchronous simplex channels.…”

Section: Related Workmentioning

confidence: 99%

“…A notable case in point is the Iris framework (Jung et al 2018) embedded in Coq (The Coq development team), which provides an impredicative, higher-order, concurrent separation logic (CSL) (O'Hearn 2004;Reynolds 2002) within which to specify and prove programs. Iris has been used to model various languages and constructs, and to verify many interesting programs (Chajed et al 2019;Hinrichsen et al 2019;Krogh-Jespersen et al 2019). However, Iris is not in itself a programming language: it must instead be instantiated with a deeply embedded representation and semantics of one provided by the user.…”

Section: Introductionmentioning

confidence: 99%

SteelCore: an extensible concurrent separation logic for effectful dependently typed programs

Swamy

Rastogi

Fromherz

et al. 2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Much recent research has been devoted to modeling effects within type theory. Building on this work, we observe that effectful type theories can provide a foundation on which to build semantics for more complex programming constructs and program logics, extending the reasoning principles that apply within the host effectful type theory itself. Concretely, our main contribution is a semantics for concurrent separation logic (CSL) within the F ★ proof assistant in a manner that enables dependently typed, effectful F ★ programs to make use of concurrency and to be specified and verified using a full-featured, extensible CSL. In contrast to prior approaches, we directly derive the partial-correctness Hoare rules for CSL from the denotation of computations in the effectful semantics of non-deterministically interleaved atomic actions. Demonstrating the flexibility of our semantics, we build generic, verified libraries that support various concurrency constructs, ranging from dynamically allocated, storable spin locks, to protocol-indexed channels. We conclude that our effectful semantics provides a simple yet expressive basis on which to layer domainspecific languages and logics for verified, concurrent programming.

show abstract

Actris: session-type based reasoning in separation logic

Cited by 32 publications

References 57 publications

On algebraic abstractions for concurrent separation logics

On algebraic abstractions for concurrent separation logics

Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems

SteelCore: an extensible concurrent separation logic for effectful dependently typed programs

Contact Info

Product

Resources

About