We consider nondeterministic probabilistic programs with the most basic liveness property of
termination. We present efficient methods for termination analysis of nondeterministic …

We consider the problem of expected cost analysis over nondeterministic probabilistic
programs, which aims at automated methods for analyzing the resource-usage of such …

We study the classical problem of verifying programs with respect to formal specifications
given in the linear temporal logic (LTL). We first present novel sound and complete …

We study the problem of developing efficient approaches for proving worst-case bounds of
non-deterministic recursive programs. Ranking functions are sound and complete for …

We consider the problem of developing automated techniques for solving recurrence
relations to aid the expected-runtime analysis of programs. The motivation is that several …

In this thesis, we consider several of the most classical and fundamental problems in static
analysis and formal verification, including invariant generation, reachability analysis …

We propose a new approach to synthesis of non-polynomial ranking functions for loops via
deep neural network (DNN). Firstly, we construct a ranking function template by DNN …

Termination of programs is probably the most famous undecidable problem in computer
science. Despite this undecidability result, a lot of effort has been spent on improving …

In this paper, the problems of forward reachable set estimation and safety verification of
uncertain nonlinear systems with polynomial dynamics are addressed. First, an iterative …

The existence of a ranking function implies the termination of a loop. Different methods are
designed for detection of different classes of ranking functions. Moreover, for loops with …