Cover Image

Verifying Sampling Algorithms via Distributional Invariants

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zilken, Daniel, Batz, Kevin, Katoen, Joost-Pieter, Winkler, Tobias
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fixed Point Certificates for Reachability and Expected Rewards in MDPs
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back
by: Batz, Kevin, et al.
Published: (2025)

Home Spaces and Invariants to Analyze Parameterized Petri Nets
by: Memmi, Gerard
Published: (2024)

Advances in Algorithmic Meta Theorems
by: Siebertz, Sebastian, et al.
Published: (2024)

Quantifier Elimination and Craig Interpolation, Quantitatively
by: Batz, Kevin, et al.
Published: (2025)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
by: Lyon, Tim S.
Published: (2022)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
by: Fuchser, Janne, et al.
Published: (2025)

Logic-based analogical proportions
by: Antić, Christian
Published: (2024)

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
by: Kiefer, Sandra, et al.
Published: (2024)

Verified Certificates via SAT and Computer Algebra Systems for the Ramsey $R(3, 8)$ and $R(3, 9)$ Problems
by: Li, Zhengyu, et al.
Published: (2025)

Statistical Model Checking Beyond Means: Quantiles, CVaR, and the DKW Inequality (extended version)
by: Budde, Carlos E., et al.
Published: (2025)

Rice-like complexity lower bounds for Boolean and uniform automata networks
by: Goubault-Larrecq, Aliénor, et al.
Published: (2024)

Separability Properties of Monadically Dependent Graph Classes
by: Bonnet, Édouard, et al.
Published: (2025)

Epsilon-saturation for stable graphs and Littlestone classes
by: Malliaris, Maryanthe, et al.
Published: (2025)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)

Existential Positive Transductions of Sparse Graphs
by: Mählmann, Nikolas, et al.
Published: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
by: Dreier, Jan, et al.
Published: (2024)

Complexity lower bounds for succinct binary structures of bounded clique-width with restrictions
by: Geniet, Colin, et al.
Published: (2026)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
by: Neuen, Daniel, et al.
Published: (2026)

Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
by: Mertens, Hannah, et al.
Published: (2024)

SAT-Solving the Poset Cover Problem
by: Yuan, Chih-Cheng Rex, et al.
Published: (2025)

Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
by: Haar, Stefan, et al.
Published: (2025)

On the number of asynchronous attractors in AND-NOT Boolean networks
by: Trinh, Van-Giang, et al.
Published: (2025)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
by: Van Caudenberg, Daimy, et al.
Published: (2025)

The Iteration Number of the Weisfeiler-Leman Algorithm
by: Grohe, Martin, et al.
Published: (2023)

Learning Foundations Beneath the Stars
by: Cardone, Felice, et al.
Published: (2026)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
by: Bacik, Piotr, et al.
Published: (2026)

Efficient reversal of transductions of sparse graph classes
by: Dreier, Jan, et al.
Published: (2026)

Hypergraph rewriting and Causal structure of $λ-$calculus
by: Bajaj, Utkarsh
Published: (2024)

Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
by: Dreier, Jan
Published: (2021)

North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
by: Barnoff, Aaron, et al.
Published: (2025)

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
by: Brakensiek, Joshua, et al.
Published: (2026)

An Algorithmic Meta Theorem for Homomorphism Indistinguishability
by: Seppelt, Tim
Published: (2024)

Restricted CSPs and F-free Digraph Algorithmics
by: Guzmán-Pro, Santiago, et al.
Published: (2025)

The unstable formula theorem revisited via algorithms
by: Malliaris, Maryanthe, et al.
Published: (2022)

Lower Bounds on Inverse Cellular Automata via Proof Complexity
by: Kapytka, Maryia
Published: (2026)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)