{"paper":{"title":"Caesar: A Deductive Verifier for Probabilistic Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Caesar translates HeyVL programs for probabilistic programs into verification conditions checked by Z3.","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Benjamin Lucien Kaminski, Christoph Matheja, Darion Haase, Joost-Pieter Katoen, Kevin Batz, Philipp Schr\\\"oer, Umut Yi\\u{g}it Dural","submitted_at":"2026-05-15T10:27:07Z","abstract_excerpt":"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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Caesar translates HeyVL programs into verification conditions checked by Z3, with an additional probabilistic model-checking backend for a subset of HeyVL, after five years of development including new proof rules and better diagnostics.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The underlying HeyLo logic and the added proof rules are sound, and Z3 is capable of deciding the generated verification conditions for the intended class of probabilistic programs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Caesar translates HeyVL programs for probabilistic programs into verification conditions checked by Z3.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2c9d3243d871e767b009b18388543228240db782a4f6ae81de0f00f716af7f24"},"source":{"id":"2605.15827","kind":"arxiv","version":1},"verdict":{"id":"f571aa86-605c-4af0-b2c5-b12829d80777","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:09:23.901020Z","strongest_claim":"Caesar translates HeyVL programs into verification conditions checked by Z3, with an additional probabilistic model-checking backend for a subset of HeyVL, after five years of development including new proof rules and better diagnostics.","one_line_summary":"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.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The underlying HeyLo logic and the added proof rules are sound, and Z3 is capable of deciding the generated verification conditions for the intended class of probabilistic programs.","pith_extraction_headline":"Caesar translates HeyVL programs for probabilistic programs into verification conditions checked by Z3."},"integrity":{"clean":false,"summary":{"advisory":2,"critical":0,"by_detector":{"doi_compliance":{"total":2,"advisory":2,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2605.15827/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.18154/RWTH-2025-07050.https://publications.rwth-aachen.de/record/1016969) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":22,"audited_at":"2026-05-19T18:21:41.980183Z","detected_doi":"10.18154/RWTH-2025-07050.https://publications.rwth-aachen.de/record/1016969","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-68167-2_2616) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":31,"audited_at":"2026-05-19T18:21:41.980183Z","detected_doi":"10.1007/978-3-319-68167-2_2616","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.782650Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:21:41.980183Z","status":"completed","version":"1.0.0","findings_count":2},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.721071Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.863908Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"bfb7fde55374777be8dd9a9a2ef1345e008eaa9230013228a17ad65b971751df"},"references":{"count":74,"sample":[{"doi":"10.1007/978-3-030-81688-9_1","year":2021,"title":"In: Silva, A., Leino, K.R.M","work_id":"e1b289e1-b6ad-4815-9151-6c1d3225ed63","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3732291","year":2025,"title":"Affeldt, R., Cohen, C., Saito, A.: Semantics of Probabilistic Programs Using s- Finite Kernels in Dependent Type Theory. ACM Trans. Probab. Mach. Learn. 1(3) (2025).https://doi.org/10.1145/3732291","work_id":"f07f2489-65ee-4e93-8e15-0bf8a568d594","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3158122","year":2018,"title":"Agrawal, S., Chatterjee, K., Novotn´ y, P.: Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. Proc. ACM Pro- gram. Lang.2(POPL), 34:1–34:32 (2018)","work_id":"21d48f6e-17eb-47be-b88a-3e49f2d882b3","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3434333","year":2021,"title":"Aguirre, A., Barthe, G., Hsu, J., Kaminski, B.L., Katoen, J., Matheja, C.: A pre-expectation calculus for probabilistic sensitivity. Proc. ACM Program. Lang. 5(POPL), 1–28 (2021).https://doi.org/10.11","work_id":"d8635570-e372-4810-a67b-2eb8b82afdb6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"(eds.): Deductive Software Verification - The KeY Book - From Theory to Practice","work_id":"b0f7420d-0fc3-41ea-b44f-70b43e88c13b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":74,"snapshot_sha256":"0104a3f9506882c1a2c49c09b53d9c6f2a53b8c06cfa743edfb59909a98da7d8","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"53f329490cfd89dd7fbdad24134e5e2c3fa355cbdf9bd0d8665c52cee916cb86"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}