Foundational Integration Verification of a Cryptographic Server
A Erbsen, J Philipoom, D Jamner, A Lin… - Proceedings of the …, 2024 - dl.acm.org
We present verification of a bare-metal server built using diverse implementation techniques
and languages against a whole-system input-output specification in terms of machine code …
and languages against a whole-system input-output specification in terms of machine code …
Verifying reliable network components in a distributed separation logic with dependent separation protocols
L Gondelman, JK Hinrichsen, M Pereira… - Proceedings of the …, 2023 - dl.acm.org
We present a foundationally verified implementation of a reliable communication library for
asynchronous client-server communication, and a stack of formally verified components on …
asynchronous client-server communication, and a stack of formally verified components on …
Modular Denotational Semantics for Effects with Guarded Interaction Trees
We present guarded interaction trees—a structure and a fully formalized framework for
representing higher-order computations with higher-order effects in Coq, inspired by domain …
representing higher-order computations with higher-order effects in Coq, inspired by domain …
An Iris instance for verifying CompCert C programs
Iris is a generic separation logic framework that has been instantiated to reason about a
wide range of programming languages and language features. Most Iris instances are …
wide range of programming languages and language features. Most Iris instances are …
Later credits: resourceful reasoning for the later modality
In the past two decades, step-indexed logical relations and separation logics have both
come to play a major role in semantics and verification research. More recently, they have …
come to play a major role in semantics and verification research. More recently, they have …
Formally verified simulations of state-rich processes using interaction trees in Isabelle/HOL
Simulation and formal verification are important complementary techniques necessary in
high assurance model-based systems development. In order to support coherent results, it is …
high assurance model-based systems development. In order to support coherent results, it is …
Program adverbs and Tlön embeddings
Free monads (and their variants) have become a popular general-purpose tool for
representing the semantics of effectful programs in proof assistants. These data structures …
representing the semantics of effectful programs in proof assistants. These data structures …
Formally verified samplers from probabilistic programs with loops and conditioning
A Bagnall, G Stewart, A Banerjee - Proceedings of the ACM on …, 2023 - dl.acm.org
We present Zar: a formally verified compiler pipeline from discrete probabilistic programs
with unbounded loops in the conditional probabilistic guarded command language (cpGCL) …
with unbounded loops in the conditional probabilistic guarded command language (cpGCL) …
Securing Verified IO Programs Against Unverified Code in F
We introduce SCIO*, a formally secure compilation framework for statically verified programs
performing input-output (IO). The source language is an F* subset in which a verified …
performing input-output (IO). The source language is an F* subset in which a verified …
Kivi: Verification for Cluster Management
Modern cloud infrastructure is powered by cluster management systems such as Kubernetes
and Docker Swarm. While these systems seek to minimize users' operational burden, the …
and Docker Swarm. While these systems seek to minimize users' operational burden, the …