Chenyi Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chenyi Zhang has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Franck Cassez
ConsenSys
1 shared publication - Guoping Zhao
CAS-Key Laboratory of Synthetic Biology, CAS Center for Excellence in Molecular Plant Sciences, Shanghai Institute of Plant Physiology and Ecology, Chinese Academy of Sciences, Shanghai, China
1 shared publication - JianLei Gu
State Key Laboratory of Genetic Engineering, School of Life Sciences, Fudan University, Shanghai, 200433, People's Republic of China.
1 shared publication - Jianping Jiang
State Key Laboratory of Genetic Engineering, School of Life Sciences, Fudan University, Shanghai, 200433, People's Republic of China.
1 shared publication - Jun Pang
Faculty of Science, Technology and Medicine, University of Luxembourg, Esch-Sur-Alzette, Luxembourg
1 shared publication - Liang Zhang
Shanghai-MOST Key Laboratory of Health and Disease Genomics, Chinese National Human Genome Center at Shanghai, Shanghai, 201203, People's Republic of China.
1 shared publication
Latest Publications
- Open Access
- 14 February 2015
- Published by Springer Nature in BMC Genomics
- Vol. 16 (1) , 85
Comparing Mycobacterium tuberculosis genomes using genome topology networks
- 14 February 2015
- Published by Springer Nature in BMC Genomics
- Vol. 16 (1) , 85
Open AccessComparing Mycobacterium tuberculosis genomes using genome topology networks
- Open Access
The Complexity of Synchronous Notions of Information Flow Security
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 which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.
Open AccessThe Complexity of Synchronous Notions of Information Flow Security
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 which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.
- Open Access
- 21 March 2012
- Published by Springer Nature in Innovations in Systems and Software Engineering
- Vol. 8 (2) , 111-124
Game-based verification of contract signing protocols with minimal messages
- 21 March 2012
- Published by Springer Nature in Innovations in Systems and Software Engineering
- Vol. 8 (2) , 111-124
Open AccessGame-based verification of contract signing protocols with minimal messages