Kevin Batz

Orcid: 0000-0001-8705-2564

According to our database1, Kevin Batz authored at least 33 papers between 2018 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Caesar: A Deductive Verifier for Probabilistic Programs.
CoRR, May, 2026

SMT-Based Active Learning of Weighted Automata.
CoRR, May, 2026

Weighted NetKAT: A Programming Language For Quantitative Network Verification.
CoRR, April, 2026

Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops (Extended Version).
CoRR, January, 2026

Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops: Artifact.
Dataset, January, 2026

The Algebra of Iterative Constructions.
Arch. Formal Proofs, 2026

Verifying Sampling Algorithms via Distributional Invariants.
Proceedings of the Formal Methods - 27th International Symposium, 2026

Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops.
Proceedings of the Programming Languages and Systems, 2026

2025
Artifact for Paper Foundations for Deductive Verification of Continuous Probabilistic Programs.
Dataset, June, 2025

Artifact for Paper Foundations for Deductive Verification of Continuous Probabilistic Programs.
Dataset, April, 2025

Quantifier Elimination and Craig Interpolation: The Quantitative Way (Technical Report).
CoRR, January, 2025

Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back.
Proc. ACM Program. Lang., 2025

Quantifier Elimination and Craig Interpolation: The Quantitative Way.
Proceedings of the Foundations of Software Science and Computation Structures, 2025

2024
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs.
Proc. ACM Program. Lang., January, 2024

Automated deductive verification of probabilistic programs.
PhD thesis, 2024

J-P: MDP. FP. PP.: Characterizing Total Expected Rewards in Markov Decision Processes as Least Fixed Points with an Application to Operational Semantics of Probabilistic Programs (Technical Report).
CoRR, 2024

J-P: MDP. FP. PP - Characterizing Total Expected Rewards in Markov Decision Processes as Least Fixed Points with an Application to Operational Semantics of Probabilistic Programs.
Proceedings of the Principles of Verification: Cycling the Probabilistic Landscape, 2024

2023
A Deductive Verification Infrastructure for Probabilistic Programs.
Proc. ACM Program. Lang., October, 2023

A Deductive Verification Infrastructure for Probabilistic Programs - Artifact Evaluation.
Dataset, July, 2023

A Calculus for Amortized Expected Runtimes.
Proc. ACM Program. Lang., January, 2023

Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

2022
Weighted programming: a programming paradigm for specifying mathematical models.
Proc. ACM Program. Lang., 2022

Weighted Programming.
CoRR, 2022

Foundations for Entailment Checking in Quantitative Separation Logic (extended version).
CoRR, 2022

Foundations for Entailment Checking in Quantitative Separation Logic.
Proceedings of the Programming Languages and Systems, 2022

2021
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning.
Proc. ACM Program. Lang., 2021

Latticed k-Induction with an Application to Probabilistic Programs.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Relatively Complete Verification of Probabilistic Programs.
CoRR, 2020

Generating Functions for Probabilistic Programs.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2020

PrIC3: Property Directed Reachability for MDPs.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2019
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs.
Proc. ACM Program. Lang., 2019

2018
Quantitative Separation Logic.
CoRR, 2018

How long, O Bayesian network, will I sample thee? - A program analysis perspective on expected sampling times.
Proceedings of the Programming Languages and Systems, 2018


  Loading...