research
∙
07/25/2023
Affine Disjunctive Invariant Generation with Farkas' Lemma
Invariant generation is the classical problem that aims at automated gen...
share
research
∙
07/24/2023
Template-Based Static Posterior Inference for Bayesian Probabilistic Programming
In Bayesian probabilistic programming, a central problem is to estimate ...
research
∙
05/24/2023
Automated Tail Bound Analysis for Probabilistic Recurrence Relations
Probabilistic recurrence relations (PRRs) are a standard formalism for d...
research
∙
05/30/2022
Guided Diffusion Model for Adversarial Purification
With wider application of deep neural networks (DNNs) in various algorit...
research
∙
11/30/2020
Quantitative Analysis of Assertion Violations in Probabilistic Programs
In this work, we consider the fundamental problem of deriving quantitati...
research
∙
08/02/2020
Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations
Analyzing probabilistic programs and randomized algorithms are classical...
research
∙
07/28/2020
Inductive Reachability Witnesses
In this work, we consider the fundamental problem of reachability analys...
research
∙
02/13/2019
Proving Expected Sensitivity of Probabilistic Programs with Randomized Execution Time
The notion of program sensitivity (aka Lipschitz continuity) specifies t...
research
∙
02/12/2019
Cost Analysis of Nondeterministic Probabilistic Programs
We consider the problem of expected cost analysis over nondeterministic ...
research
∙
02/12/2019
Polynomial Invariant Generation for Non-deterministic Recursive Programs
We present a sound and complete method to generate inductive invariants ...
research
∙
01/18/2019
Compositional Analysis for Almost-Sure Termination of Probabilistic Programs
In this work, we consider the almost-sure termination problem for probab...
research
∙
06/14/2018
New Approaches for Almost-Sure Termination of Probabilistic Programs
We study the almost-sure termination problem for probabilistic programs....
research
∙
04/24/2018
Computational Approaches for Stochastic Shortest Path on Succinct MDPs
We consider the stochastic shortest path (SSP) problem for succinct Mark...
research
∙
12/01/2017
