Rust is a young systems programming language that aims to fill the gap between high-level
languages—which provide strong static guarantees like memory and thread safety—and low …

Recent years have witnessed an increasing interest in training machines with reasoning
ability, which deeply relies on accurately and clearly presented clue forms. The clues are …

Verifying fine-grained optimistic concurrent programs remains an open problem. Modern
program logics provide abstraction mechanisms and compositional reasoning principles to …

We present a new flow framework for separation logic reasoning about programs that
manipulate general graphs. The framework overcomes problems in earlier developments: it …

Abstract nekton is a new tool for checking linearizability proofs of highly complex concurrent
search structures. The tool's unique features are its parametric heap abstraction based on …

Concurrent separation logics have had great success reasoning about concurrent data
structures. This success stems from their application of modularity on multiple levels, leading …

Automatically proving linearizability of concurrent data structures remains a key challenge
for verification. We present temporal interpolation as a new proof principle to guide …

We develop machine-checked verifications of the full functional correctness of C
implementations of the eponymous graph algorithms of Dijkstra, Kruskal, and Prim. We …

We propose a novel mechanism of defining data structures using intrinsic definitions that
avoids recursion and instead utilizes monadic maps satisfying local conditions. We show …

Multicopy search structures such as log-structured merge (LSM) trees are optimized for high
insert/update/delete (collectively known as upsert) performance. In such data structures, an …