Modern computer systems consist of a multitude of abstraction layers (eg, OS kernels,
hypervisors, device drivers, network protocols), each of which defines an interface that hides …

Separation logic is an extension of Hoare's logic which supports a local way of reasoning
about programs that mutate memory. We present a study of the semantic structures lying …

Efficient concurrent programs and data structures rarely employ coarse-grained
synchronization mechanisms (ie, locks); instead, they implement custom synchronization …

We investigate proof rules for information hiding, using the recent formalism of separation
logic. In essence, we use the separating conjunction to partition the internal resources of a …

Distributed systems play a crucial role in modern infrastructure, but are notoriously difficult to
implement correctly. This difficulty arises from two main challenges:(a) correctly …

We describe an axiomatic extension to the Coq proof assistant, that supports writing,
reasoning about, and extracting higher-order, dependently-typed programs with side-effects …

Moggi's Computational Monads and Power et al.'s equivalent notion of Freyd category have
captured a large range of computational effects present in programming languages …

Information-Flow Control (IFC) is a well-established approach for allowing untrusted code to
manipulate sensitive data without disclosing it. IFC is typically enforced via type systems and …

We report on our experience implementing a lightweight, fully verified relational database
management system (RDBMS). The functional specification of RDBMS behavior, RDBMS …

Over the last decade, there has been extensive research on modelling challenging features
in programming languages and program logics, such as higher-order store and storable …