Chenyi Zhang

Orcid: 0000-0002-3054-5883

Affiliations:
  • University of Canterbury, Christchurch, New Zealand
  • Jinan University, College of Information Science and Technology, Guangzhou, China (former)
  • Oracle Labs Australia, Brisbane, QLD, Australia (former)
  • University of Queensland, Brisbane, QLD, Australia (former)
  • University of Luxembourg, Faculty of Sciences, Technology and Communication, Luxembourg (former)
  • University of New South Wales, Sydney, NSW, Australia (PhD)


According to our database1, Chenyi Zhang authored at least 47 papers between 2006 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Anomaly Detection Based on Critical Paths for Deep Neural Networks.
CoRR, May, 2025

Automatic Verification of Linear Integer Planning Programs via Forgetting in LIAUPF.
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

2024
Call-Graph-Based Context-Sensitive Points-to Analysis for Java.
IEEE Trans. Reliab., June, 2024

2023
Adversarial Detection from Derived Models.
Int. J. Pattern Recognit. Artif. Intell., December, 2023

Monotonic learning with hypothesis evolution.
Inf. Sci., November, 2023

2022
Modal characterisation of simulation relations in probabilistic concurrent games.
Sci. Comput. Program., 2022

A Uniform Framework for Anomaly Detection in Deep Neural Networks.
Neural Process. Lett., 2022

A Mask-Based Adversarial Defense Scheme.
Algorithms, 2022

Taint Trace Analysis For Java Web Applications.
Proceedings of the 34th International Conference on Software Engineering and Knowledge Engineering, 2022

Parameter Sensitive Pointer Analysis for Java.
Proceedings of the 26th International Conference on Engineering of Complex Computer Systems, 2022

2020
Preface for the special issue of the 12th International Symposium on Theoretical Aspects of Software Engineering (TASE 2018).
Sci. Comput. Program., 2020

TFA: an efficient and precise virtual method call resolution for Java.
Formal Aspects Comput., 2020

Minimal consistent DFA from sample strings.
Acta Informatica, 2020

Characterising Probabilistic Alternating Simulation for Concurrent Games.
Proceedings of the International Symposium on Theoretical Aspects of Software Engineering, 2020

Nontransitive Security Types for Coarse-grained Information Flow Control.
Proceedings of the 33rd IEEE Computer Security Foundations Symposium, 2020

2019
A Relational Static Semantics for Call Graph Construction.
Proceedings of the Formal Methods and Software Engineering, 2019

2018
Reference Abstract Domains and Applications to String Analysis.
Fundam. Informaticae, 2018

2017
Combining String Abstract Domains for JavaScript Analysis: An Evaluation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Improving the Scalability of Automatic Linearizability Checking in SPIN.
Proceedings of the Formal Methods and Software Engineering, 2017

2016
The complexity of synchronous notions of information flow security.
Theor. Comput. Sci., 2016

2015
An I/O Efficient Approach for Detecting All Accepting Cycles.
IEEE Trans. Software Eng., 2015

2013
Information flow in systems with schedulers, Part II: Refinement.
Theor. Comput. Sci., 2013

Information flow in systems with schedulers, Part I: Definitions.
Theor. Comput. Sci., 2013

Design and formal verification of a CEM protocol with transparent TTP.
Frontiers Comput. Sci., 2013

Path-Sensitive Data Flow Analysis Simplified.
Proceedings of the Formal Methods and Software Engineering, 2013

2012
A trust-augmented voting scheme for collaborative privacy management.
J. Comput. Secur., 2012

Game-based verification of contract signing protocols with minimal messages.
Innov. Syst. Softw. Eng., 2012

An Algorithm for Probabilistic Alternating Simulation.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Translating flowcharts to non-deterministic languages.
Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, 2012

A Type and Effect System for Determinism in Multithreaded Programs.
Proceedings of the Programming Languages and Systems, 2012

Intransitive noninterference in nondeterministic systems.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

Probabilistic Alternating-Time Temporal Logic of Incomplete Information and Synchronous Perfect Recall.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Conditional Information Flow Policies and Unwinding Relations.
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

2010
A comparison of semantic models for noninterference.
Theor. Comput. Sci., 2010

Verification of A Key Chain Based TTP Transparent CEM Protocol.
Proceedings of the 4th International Workshop on Harnessing Theories for Tool Support in Software, 2010

Unwinding Conditional Noninterference
CoRR, 2010

On Probabilistic Alternating Simulations.
Proceedings of the Theoretical Computer Science, 2010

Extending a Key-Chain Based Certified Email Protocol with Transparent TTP.
Proceedings of the IEEE/IFIP 8th International Conference on Embedded and Ubiquitous Computing, 2010

2009
Information flow security - models, verification and schedulers.
PhD thesis, 2009

How to Work with Honest but Curious Judges? (Preliminary Report)
Proceedings of the Proceedings 7th International Workshop on Security Issues in Concurrency, 2009

Game-Based Verification of Multi-Party Contract Signing Protocols.
Proceedings of the Formal Aspects in Security and Trust, 6th International Workshop, 2009

2008
User-Input Dependence Analysis via Graph Reachability.
Proceedings of the Eighth IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2008), 2008

Information Flow in Systems with Schedulers.
Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

2007
Remarks on Testing Probabilistic Processes.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Characterising Testing Preorders for Finite Probabilistic Processes.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Scalar Outcomes Suffice for Finitary Probabilistic Testing.
Proceedings of the Programming Languages and Systems, 2007

2006
Algorithmic Verification of Noninterference Properties.
Proceedings of the Second International Workshop on Views on Designing Complex Architectures, 2006


  Loading...