• Publications
  • Influence
Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning
TLDR
Iris, a concurrent separation logic with a simple premise: monoids and invariants are all you need, supports the encoding of *logically atomic specifications*, i.e., Hoare-style specs that permit the client of an operation to treat the operation essentially as if it were atomic, even if it is not. Expand
Hoare type theory, polymorphism and separation1
TLDR
It is established that HTT is sound and compositional, in the sense that separate verifications of individual program components suffice to ensure the correctness of the composite program, and in the presence of type polymorphism, it becomes possible to interpret the Hoare types in the “small footprint” manner. Expand
Views: compositional reasoning for concurrent programs
TLDR
This paper presents the "Concurrent Views Framework", a metatheory of concurrent reasoning principles that proves each of these systems is sound without requiring induction on the operational semantics. Expand
First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees
TLDR
It is proposed that the internal logic of S provides the right setting for the synthetic construction of abstract versions of step-indexed models of programming languages and program logics. Expand
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
TLDR
A reasonably complete picture of the latest version of Iris is presented, from first principles and in one coherent narrative, to fill the gap in the design and semantic foundations of Iris itself. Expand
Impredicative Concurrent Abstract Predicates
TLDR
iCAP uses protocols to reason about shared mutable state, and demonstrates the utility of impredicative protocols through a series of examples, including the specification and verification of a spin-lock, a reentrant event loop, and a concurrent bag implemented using cooperation, against modular specifications. Expand
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
TLDR
CaReSL is presented, the first logic to support the use of granularity abstraction for modular verification of higher-order concurrent programs, and its effectiveness is demonstrated by using it to tackle a significant case study: the first formal proof of (partial) correctness for Hendler et al.'s "flat combining" algorithm. Expand
The impact of higher-order state and control effects on local relational reasoning
TLDR
This paper defines the first fully abstract logical relation for an ML-like language with recursive types, abstract types, general references and call/cc, and shows how it can enhance the proving power of the possible-worlds model in correspondingly orthogonal ways. Expand
From region inference to von Neumann machines via region representation inference
TLDR
This paper is concerned with mapping the mathematical model of region inference onto real machines by composing region inference with Region Representation Inference, which gradually refines region information till it is directly implementable on conventional von Neumann machines. Expand
Step-indexed kripke models over recursive worlds
TLDR
The semantics of Charguéraud and Pottier's type-and-capability system for an ML-like higher-order language is demonstrated and the method provides a high-level understanding of the essence of recent approaches based on step indexing. Expand
...
1
2
3
4
5
...