We consider nondeterministic probabilistic programs with the most basic liveness property of termination. We present efficient methods for termination analysis of nondeterministic probabilisticâ€¦ (More)

Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets ofâ€¦ (More)

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 proving termination andâ€¦ (More)

A set S âŠ† V of the graph G = (V,E) is called a [1, 2]-set of G if any vertex which is not in S has at least one but no more than two neighbors in S. A set Sï¿½ âŠ† V is called a [1, 2]-total set of G ifâ€¦ (More)

An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spaces, mostly from aâ€¦ (More)

The notion of treewidth of graphs has been exploited for faster algorithms for several problems arising in verification and program analysis. Moreover, various notions of balanced tree decompositionsâ€¦ (More)

Crypto-currencies are digital assets designed to work as a medium of exchange, e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants). A framework for the analysis ofâ€¦ (More)

We consider the stochastic shortest path (SSP) problem for succinct Markov decision processes (MDPs), where the MDP consists of a set of variables, and a set of nondeterministic rules that update theâ€¦ (More)