
On Lexicographic Proof Rules for Probabilistic Termination
We consider the almostsure (a.s.) termination problem for probabilistic...
read it

Proving Nontermination by Program Reversal
We present a new approach to proving nontermination of nondeterministi...
read it

Scalable Verification of Quantized Neural Networks (Technical Report)
Formal verification of neural networks is an active topic of research, a...
read it

Proving AlmostSure Termination of Probabilistic Programs via Incremental Pruning
The extension of classical imperative programs with realvalued random v...
read it

InfiniteDuration AllPay Bidding Games
A graph game is a twoplayer zerosum game in which the players move a t...
read it

Bidding Mechanisms in Graph Games
In twoplayer games on graphs, the players move a token through a graph ...
read it

Optimizing Expectation with Guarantees in POMDPs (Technical Report)
A standard objective in partiallyobservable Markov decision processes (...
read it
Đorđe Žikelić
is this you? claim profile