activity
20182026
most citedQuantitative Separation Logic - A Logic for Reasoning about Probabilistic Programs

43 citations · 69 across the 16 of their papers we have counts for

collaborators
Showing 2026Show all

9 papers · 1 filter

cs.PL2026

Type-Directed Discretization of Probabilistic Programs (Extended Version)

Katherine Wu, Jules Jacobs, Kevin Batz +1

We study exact discretization as a semantics-preserving transformation for recursive, higher-order probabilistic programs with continuous distributions. We target programs where co…

cs.PL2026

Multiobjective Preexpectation Reasoning for Probabilistic Programs

Lena Verscht, Hannah Mertens, Kevin Batz +3

Probabilistic programs with nondeterminism model planning problems in which a strategy typically resolves the nondeterminism to meet a specification. We study the multiobjective se…

cs.PL2026

A Fast Quantitative Analyzer for NetKAT

Thomas Lu, Qiancheng Fu, Kevin Batz +5

When designing a network, engineers must navigate trade-offs (e.g., one topology offers more aggregate bandwidth, another lower latency or better resilience) that demand reasoning…

cs.PL2026

Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams

Daniel Basgöze, Kevin Batz, Sebastian Junges +1

Weakest pre-expectations are the probabilistic program analogue to weakest preconditions in classical programs. Deductive verification approaches aim to establish bounds on these q…

cs.PL2026

Caesar: A Deductive Verifier for Probabilistic Programs

Philipp Schröer, Kevin Batz, Umut Yiğit Dural +4

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 all…

cs.LO2026

The Algebra of Iterative Constructions

Kevin Batz, Benjamin Lucien Kaminski, Lucas Kehrer +3

Fixed points are a recurring theme in computer science and are often constructed as limits of suitably seeded fixed point iterations. We present the algebra of iterative constructi…

cs.FL2026

SMT-Based Active Learning of Weighted Automata

Tiago Ferreira, Kevin Batz, Alexandra Silva

We present an SMT-based active learning algorithm for nondeterministic weighted automata (WFAs) as a practical and robust alternative to Hankel/L*-style methods. Our algorithm is p…

cs.PL2026

Weighted NetKAT: A Programming Language For Quantitative Network Verification

Emmanuel Suárez Acevedo, Tiago Ferreira, Kevin Batz +3

We introduce weighted NetKAT, a domain-specific language for modeling and verifying quantitative network properties. The language is parametric on a semiring, enabling the treatmen…

cs.PL2026★ 1 cited

Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops (Extended Version)

Darion Haase, Kevin Batz, Adrian Gallus +4

A fundamental computational task in probabilistic programming is to infer a program's output (posterior) distribution from a given initial (prior) distribution. This problem is cha…