It is commonly believed that datacenter networking software must sacrifice generality to
attain high performance. The popularity of specialized distributed systems designed …

Modern clouds depend crucially on an extensible ecosystem of thousands of controllers,
each managing critical systems (eg, a ZooKeeper cluster). A controller continuously …

Computer-aided cryptography is an active area of research that develops and applies
formal, machine-checkable approaches to the design, analysis, and implementation of …

Rust's type system ensures memory safety: well-typed Rust programs are guaranteed to not
exhibit problems such as dangling pointers, data races, and unexpected side effects through …

Complete formal verification of a non-trivial concurrent OS kernel is widely considered a
grand challenge. We present a novel compositional approach for building certified …

Training machine learning (ML) models typically involves expensive iterative optimization.
Once the model's final parameters are released, there is currently no mechanism for the …

Interaction trees (ITrees) are a general-purpose data structure for representing the behaviors
of recursive programs that interact with their environments. A coinductive variant of “free …

Intel SGX promises powerful security: an arbitrary number of user-mode enclaves protected
against physical attacks and privileged software adversaries. However, to achieve this, Intel …

Large language models show great promise in many domains, including programming. A
promise is easy to make but hard to keep, and language models often fail to keep their …

Despite several decades of research, the problem of formal verification of infinite-state
systems has resisted effective automation. We describe a system---Ivy---for interactively …