activity
20112021
most citedA Simple Probabilistic Extension of Modal Mu-calculus

6 citations · 20 across the 8 of their papers we have counts for

collaborators

10 papers

cs.SE2021

What do all these Buttons do? Statically Mining Android User Interfaces at Scale

Konstantin Kuznetsov, Chen Fu, Song Gao +3

We introduce FRONTMATTER: a tool to automatically mine both user interface models and behavior of Android apps at a large scale with high precision. Given an app, FRONTMATTER stati…

cs.FL20201 cited

Proving Non-Inclusion of Büchi Automata based on Monte Carlo Sampling

Yong Li, Andrea Turrini, Xuechao Sun +1

The search for a proof of correctness and the search for counterexamples (bugs) are complementary aspects of verification. In order to maximize the practical use of verification to…

cs.FL20204 cited

On the Power of Unambiguity in Büchi Complementation

Yong Li, Moshe Y. Vardi, Lijun Zhang

In this work, we exploit the power of \emph{unambiguity} for the complementation problem of Büchi automata by utilizing reduced run directed acyclic graphs (DAGs) over infinite wor…

cs.LG20195 cited

Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization

Guanghui Wang, Shiyin Lu, Lijun Zhang

In this paper, we study adaptive online convex optimization, and aim to design a universal algorithm that achieves optimal regret bounds for multiple common types of loss functions…

cs.LO20171 cited

Finding polynomial loop invariants for probabilistic programs

Yijun Feng, Lijun Zhang, David N. Jansen +2

Quantitative loop invariants are an essential element in the verification of probabilistic programs. Recently, multivariate Lagrange interpolation has been applied to synthesizing…

cs.LO2017

Distribution-based bisimulation for labelled Markov processes

Pengfei Yang, David N. Jansen, Lijun Zhang

In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both on…