Skip to content

Modular Responsiveness Verification of Rust Async Runtimes

· 0 citations · 30 references

TL;DR

This work presents a lightweight and modular proof technique for verifying eventual progression guarantees for Rust async runtimes and realizes this proof technique as a set of static analyses for Rust and uses these to verify eventual progression of several key components of multiple Rust async runtime implementations.

View source

Similar papers

Book Open access Sep 2026

Lion: Modular Verification of Async Runtime Liveness

This work introduces an append-only logical event log that abstracts implementation details and enables a Kamp-style translation of Linear Temporal Logic into First-Order Logic, which enables deductive program verifiers to reason about progress via monotonic timestamps without needing native temporal logic support.

Ti Zhou, Zi-Hao Zhang, Omar Chowdhury et al. · 1 citation
Preprint Aug 2026

Synchronous Observers Revisited for Runtime Verification of Lustre Using STL

This work presents a technique for compiling the synchronous fragment of STL (SSTL) into synchronous observers in the dataflow language Lustre, and contributes an interactive visualiser that renders a property's three-valued verdict over an editable trace.

Logan Kenwright, Partha S. Roop, Sobhan Chatterjee et al. · 0 citations
Open access Oct 2026

Bringing Foundational Verification to Real-World Rust Code

How to extend RefinedRust with several of the high-level abstractions that Rust provides, including traits, closures, and iterators, and in a manner such that they can be used in conjunction with unsafe code.

Lennard Gäher, Vincent Lafeychine, Sascha Kehrli et al. · 0 citations

Agentic translation of C to Rust

An alternate agentic approach that gives an LLM freedom and guardrails is presented that gives an LLM freedom and guardrails in the Rust programming language, a promising replacement for C.

Benedikt Schesch, Michael D. Ernst · 0 citations
Book Open access Aug 2026

Chameleon: Toward Runtime-Pluggable Verification of Programmable Networks

Experimental results show that Chameleon can augment P4 programs with small one-time preprocessing and compilation overheads, and supports millisecond-level runtime configuration operations for verification requirements.

Ying Yao, Le Tian, Yu-Xiang Hu · 0 citations
Book Open access Sep 2026

Beyond Zero-Cost: Understanding Rust Safety Overheads in Systems Code

Rust is increasingly used as a viable alternative to C and C++ for systems development. A central appeal of Rust is its “zero-cost” abstractions and, specifically, its ability to enforce safety without the overhead of garbage collection. In practice, however, only a subset of safety properties can be enforced staticall...

Soham Bagchi, Manvik Nanda, A. Burtsev · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.