PLMay 15

Caesar: A Deductive Verifier for Probabilistic Programs

arXiv:2605.1582713.3
AI Analysis

For researchers and engineers verifying probabilistic programs, Caesar provides a flexible, extensible verification framework, though it is an incremental improvement over existing deductive verification approaches.

Caesar is a deductive verifier for probabilistic programs that uses the HeyVL intermediate language to integrate proof rules and translates programs into verification conditions checked by Z3. It includes a model-checking backend and reports on five years of development with improvements like additional proof rules and better diagnostics.

Caesar is a deductive verifier for probabilistic programs. At its core lies HeyVL, a quantitative intermediate verification language based on the real-valued logic HeyLo. HeyVL allows users to express a probabilistic program, its specifications, and proof rules in a programming-language style, so that new proof rules can be easily integrated into the verifier. Caesar translates HeyVL programs into verification conditions, which are then checked using the Z3 SMT solver. It also includes a backend based on probabilistic model checking for a subset of HeyVL. We report on the results of five years of development of Caesar, highlighting its main features and architecture. In particular, we describe recent improvements such as additional proof rules, a model-checking backend, and better diagnostics.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes