29 citations · 81 across the 9 of their papers we have counts for
9 papers
Linear-Time--Branching-Time Spectroscopy Accounting for Silent Steps
Benjamin Bisping, David N. Jansen
We provide the first generalized game characterization of van Glabbeek's linear-time--branching-time spectrum with silent steps. Thereby, one multi-dimensional energy game can be u…
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…
A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems
David N. Jansen, Jan Friso Groote, Jeroen J. A. Keiren +1
Branching bisimilarity is a behavioural equivalence relation on labelled transition systems that takes internal actions into account. It has the traditional advantage that algorith…
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…
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…
Stuttering equivalence is too slow!
David N. Jansen, Jeroen J. A. Keiren
Groote and Wijs recently described an algorithm for deciding stuttering equivalence and branching bisimulation equivalence, acclaimed to run in time. Unfort…