Ownership and borrowing systems, designed to enforce safe memory management without
the need for garbage collection, have been brought to the fore by the Rust programming …

MAG π is a Multiparty, Asynchronous and Generalised π-calculus that introduces timeouts
into session types as a means of reasoning about failure-prone communication. Its type …

In functional programming, regular types are a subset of algebraic data types formed from
products and sums with their respective units. One can view regular types as forming a …

Session types provide guarantees about concurrent behaviour and can be understood
through their correspondence with linear logic, with propositions as sessions and proofs as …

Type refinements combine the compositionality of typechecking with the expressivity of
program logics, offering a synergistic approach to program verification. In this paper we …

Process calculi are language-based formalisms for investigating software systems with
concurrent and/or parallel behaviors. In particular, reasoning about the correctness of such …

Then, program analyses are phrased as (dis) proving theorems in the logic. While the role of
formal logic is clear in the latter part, representing processes and their interactions as logical …