Ying Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ying Zhou has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Li Liao
School of Computer Science and Engineering, Southeast University, Street of Southeast University, Nanjing, Jiangsu, P. R. China
3 shared publications - Bixin Li
Southeast University
2 shared publications - Lulu Wang
School of Computer Science and Engineering, Southeast University, Nanjing 211189, P. R. China
2 shared publications - Can Zhao
School of Computer Science and Engineering, Southeast University, Nanjing 211189, P. R. China
1 shared publication - Jianming Chang
School of Computer Science and Engineering, Southeast University, Street of Southeast University, Nanjing, Jiangsu, P. R. China
1 shared publication - Yin Li
School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu, China
1 shared publication
Latest Publications
- 30 October 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- p. 1-34
Litmus: Evaluating the Resilience of Blockchain-Enabled Software Systems for Supply Chains via Architecture Modeling and Chaos Injection
Resilience is vital to blockchain-enabled software systems for supply chains (ChainFusion) and enables them to automatically adapt and continue providing their service when adverse situations occur. Since the notion of resilience in ChainFusion encompasses both the characteristics of a blockchain-enabled software system and the features of supply chains, complex trade-offs often exist among its resilience metrics. Furthermore, while blockchain technology provides novel mechanisms for enhancing resilience, it also introduces new resilience-related challenges. When evaluating the resilience, it is crucial to evaluate the impact of blockchain technology on resilience. We propose Litmus, a method for evaluating the resilience of ChainFusion. Litmus first models the system architecture using activity diagrams and extracts the minimal paths of the business process. Litmus then evaluates the resilience and outputs resilience issues by continuously injecting chaos into the system and monitoring variations in system state resilience curve. We assess the quality of Litmus by comparison with related work and through ablation experiments. We conduct case studies on a shipbuilding supply chain to evaluate the effectiveness of Litmus. Litmus identifies three previously unknown potential resilience issues.
- 30 October 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- p. 1-34
Litmus: Evaluating the Resilience of Blockchain-Enabled Software Systems for Supply Chains via Architecture Modeling and Chaos Injection
Resilience is vital to blockchain-enabled software systems for supply chains (ChainFusion) and enables them to automatically adapt and continue providing their service when adverse situations occur. Since the notion of resilience in ChainFusion encompasses both the characteristics of a blockchain-enabled software system and the features of supply chains, complex trade-offs often exist among its resilience metrics. Furthermore, while blockchain technology provides novel mechanisms for enhancing resilience, it also introduces new resilience-related challenges. When evaluating the resilience, it is crucial to evaluate the impact of blockchain technology on resilience. We propose Litmus, a method for evaluating the resilience of ChainFusion. Litmus first models the system architecture using activity diagrams and extracts the minimal paths of the business process. Litmus then evaluates the resilience and outputs resilience issues by continuously injecting chaos into the system and monitoring variations in system state resilience curve. We assess the quality of Litmus by comparison with related work and through ablation experiments. We conduct case studies on a shipbuilding supply chain to evaluate the effectiveness of Litmus. Litmus identifies three previously unknown potential resilience issues.
- 27 March 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 36 (14) , 2021-2068
Refined Program Slicing Based on Online Redundancy Removal
Program slicing is widely used in software engineering to support program comprehension, debugging, and testing. Most existing slicing techniques generate slices through reachability analysis over dependence graphs. However, such approaches do not distinguish between essential dependences and redundant dependences, causing many statements that do not actually affect the slicing criterion to be included in the slice. This phenomenon leads to slice bloat and makes it difficult for developers to identify the code that truly affects the slicing criterion. To address this problem, this paper introduces the concept of Redundant Code for a Slice (RCS), which refers to statements that appear in a slice due to dependence propagation but do not contribute to the values computed at the slicing criterion. We further identify six common types of RCS in real-world programs and propose a Marked System Dependence Graph (MSDG) to explicitly represent redundant and non-redundant dependences in the dependence graph. Based on MSDG, we present a refined program slicing algorithm, called RPS, which removes RCS online during dependence traversal and produces more concise slices that preserve the semantics of the slicing criterion. We evaluate RPS against traditional two-phase slicing, type slicing, and dynamic slicing on 20 open-source projects. The results show that RPS can reduce slice size by 49%, 45%, and 11% compared with the three baselines, respectively. In addition, we apply RPS to bug localization on the Defects4J benchmark. The results show that RPS can assist in locating 79% of bugs while reducing 20% of the slice size compared with type slicing.
- 27 March 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 36 (14) , 2021-2068
Refined Program Slicing Based on Online Redundancy Removal
Program slicing is widely used in software engineering to support program comprehension, debugging, and testing. Most existing slicing techniques generate slices through reachability analysis over dependence graphs. However, such approaches do not distinguish between essential dependences and redundant dependences, causing many statements that do not actually affect the slicing criterion to be included in the slice. This phenomenon leads to slice bloat and makes it difficult for developers to identify the code that truly affects the slicing criterion. To address this problem, this paper introduces the concept of Redundant Code for a Slice (RCS), which refers to statements that appear in a slice due to dependence propagation but do not contribute to the values computed at the slicing criterion. We further identify six common types of RCS in real-world programs and propose a Marked System Dependence Graph (MSDG) to explicitly represent redundant and non-redundant dependences in the dependence graph. Based on MSDG, we present a refined program slicing algorithm, called RPS, which removes RCS online during dependence traversal and produces more concise slices that preserve the semantics of the slicing criterion. We evaluate RPS against traditional two-phase slicing, type slicing, and dynamic slicing on 20 open-source projects. The results show that RPS can reduce slice size by 49%, 45%, and 11% compared with the three baselines, respectively. In addition, we apply RPS to bug localization on the Defects4J benchmark. The results show that RPS can assist in locating 79% of bugs while reducing 20% of the slice size compared with type slicing.
- 21 January 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 35 (02) , 217-241
A Method to Evaluate the Credibility of Domain Knowledge Network Using Validated Expert Knowledge
We are living in an era of knowledge explosion, where all kinds of knowledge are emerging and becoming more and more complicated with the development of new techniques and new ideas. When we study knowledge and apply them to understand and solve problems, the credibility of knowledge is becoming our main concerns. Usually, high credible domain knowledge can guide us correctly understand all concepts and the relationships between them in this domain. Due to its good layer structure and scalability, domain knowledge network is widely used to represent knowledge in knowledge engineering, artificial intelligence and others in recent years. How to ensure the credibility of domain knowledge network? This is an important and interesting topic. In this paper, we propose a method to evaluate the knowledge credibility for domain knowledge network, which means that we can start from the layer structure of domain knowledge network, and evaluate the credibility of knowledge layer by layer using validated expert knowledge such as domain dictionary, domain ontology and domain expert experience. We conduct experiments with six domain knowledge network constructed based on network data and six domain knowledge network constructed manually based on published books or domain dictionaries, which describe the same domain knowledge in pairs. Experimental results show that the knowledge credibility of domain knowledge network constructed from validated expert knowledge is significantly higher than the knowledge credibility of domain knowledge network constructed directly from network data, which satisfy our expectation and also prove the effectiveness of our credibility evaluation method.
- 21 January 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 35 (02) , 217-241
A Method to Evaluate the Credibility of Domain Knowledge Network Using Validated Expert Knowledge
We are living in an era of knowledge explosion, where all kinds of knowledge are emerging and becoming more and more complicated with the development of new techniques and new ideas. When we study knowledge and apply them to understand and solve problems, the credibility of knowledge is becoming our main concerns. Usually, high credible domain knowledge can guide us correctly understand all concepts and the relationships between them in this domain. Due to its good layer structure and scalability, domain knowledge network is widely used to represent knowledge in knowledge engineering, artificial intelligence and others in recent years. How to ensure the credibility of domain knowledge network? This is an important and interesting topic. In this paper, we propose a method to evaluate the knowledge credibility for domain knowledge network, which means that we can start from the layer structure of domain knowledge network, and evaluate the credibility of knowledge layer by layer using validated expert knowledge such as domain dictionary, domain ontology and domain expert experience. We conduct experiments with six domain knowledge network constructed based on network data and six domain knowledge network constructed manually based on published books or domain dictionaries, which describe the same domain knowledge in pairs. Experimental results show that the knowledge credibility of domain knowledge network constructed from validated expert knowledge is significantly higher than the knowledge credibility of domain knowledge network constructed directly from network data, which satisfy our expectation and also prove the effectiveness of our credibility evaluation method.