activity
20082019
most citedCharacterising Testing Preorders for Finite Probabilistic Processes

76 citations · 80 across the 8 of their papers we have counts for

collaborators

8 papers

cs.PL2019

A Relational Static Semantics for Call Graph Construction

Xilong Zhuo, Chenyi Zhang

The problem of resolving virtual method and interface calls in object-oriented languages has been a long standing challenge to the program analysis community. The complexities are…

cs.LO2019

Characterising Probabilistic Alternating Simulation for Concurrent Games

Chenyi Zhang, Jun Pang

Probabilistic game structures combine both nondeterminism and stochasticity, where players repeatedly take actions simultaneously to move to the next state of the concurrent game.…

cs.CR2014

The Complexity of Synchronous Notions of Information Flow Security

Franck Cassez, Ron van der Meyden, Chenyi Zhang

The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in wh…

cs.GT2011

An Algorithm for Probabilistic Alternating Simulation

Chenyi Zhang, Jun Pang

In probabilistic game structures, probabilistic alternating simulation (PA-simulation) relations preserve formulas defined in probabilistic alternating-time temporal logic with res…

cs.CR2010

Unwinding Conditional Noninterference

Chenyi Zhang

Noninterference provides a control over information flow in a system for ensuring confidentiality and integrity properties. In the literature this notion has been well studied as t…

cs.LO2010

On Probabilistic Alternating Simulations

Chenyi Zhang, Jun Pang

This paper presents simulation-based relations for probabilistic game structures. The first relation is called probabilistic alternating simulation, and the second called probabili…