Caesar introduces a deductive verifier for probabilistic programs using the HeyVL language, Z3 SMT solving, and a probabilistic model-checking backend after five years of development.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Develops an affine calculus and higher-order quantitative logic with novel guarded recursion and induction principles over probability measures and naturals, illustrated on Markov processes and learning algorithms.
citing papers explorer
-
Caesar: A Deductive Verifier for Probabilistic Programs
Caesar introduces a deductive verifier for probabilistic programs using the HeyVL language, Z3 SMT solving, and a probabilistic model-checking backend after five years of development.
-
Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
Develops an affine calculus and higher-order quantitative logic with novel guarded recursion and induction principles over probability measures and naturals, illustrated on Markov processes and learning algorithms.