research
∙
07/27/2023
Reachability Poorman Discrete-Bidding Games
We consider bidding games, a class of two-player zero-sum graph games. T...
share
research
∙
05/26/2023
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives
Markov decision processes can be viewed as transformers of probability d...
research
∙
11/29/2022
Quantization-aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks
We study the problem of training and certifying adversarially robust qua...
research
∙
10/11/2022
Learning Control Policies for Stochastic Systems with Reach-avoid Guarantees
We study the problem of learning controllers for discrete-time non-linea...
research
∙
10/11/2022
Learning Control Policies for Region Stabilization in Stochastic Systems
We consider the problem of learning control policies in stochastic syste...
research
∙
05/24/2022
Learning Stabilizing Policies in Stochastic Control Systems
In this work, we address the problem of learning provably stable neural ...
research
∙
04/02/2022
Differential Cost Analysis with Simultaneous Potentials and Anti-potentials
We present a novel approach to differential cost analysis that, given a ...
research
∙
12/17/2021
Stability Verification in Stochastic Control Systems via Neural Network Supermartingales
We consider the problem of formally verifying almost-sure (a.s.) asympto...
research
∙
11/04/2021
Infinite Time Horizon Safety of Bayesian Neural Networks
Bayesian neural networks (BNNs) place distributions over the weights of ...
research
∙
08/04/2021
On Lexicographic Proof Rules for Probabilistic Termination
We consider the almost-sure (a.s.) termination problem for probabilistic...
research
∙
04/02/2021
Proving Non-termination by Program Reversal
We present a new approach to proving non-termination of non-deterministi...
research
∙
12/15/2020
Scalable Verification of Quantized Neural Networks (Technical Report)
Formal verification of neural networks is an active topic of research, a...
research
∙
08/14/2020
Proving Almost-Sure Termination of Probabilistic Programs via Incremental Pruning
The extension of classical imperative programs with real-valued random v...
research
∙
05/12/2020
Infinite-Duration All-Pay Bidding Games
A graph game is a two-player zero-sum game in which the players move a t...
research
∙
05/09/2019
Bidding Mechanisms in Graph Games
In two-player games on graphs, the players move a token through a graph ...
research
∙
11/26/2016