Feng Pan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Feng Pan has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Dunwei Gong
Qingdao University of Science and Technology
2 shared publications - Xiangjuan Yao
China University of Mining and Technology
2 shared publications - Baicai Sun
College of Information Science and Technology, Qingdao University of Science and Technology, China
1 shared publication Changqing Wei
School of Mathematics, China University of Mining and Technology, Xuzhou, Jiangsu, China
1 shared publicationChong-Gao Wang
1 shared publication- Gongjie Zhang
School of Information and Control Engineering, China University of Mining and Technology, Xuzhou, Jiangsu, China
1 shared publication
Latest Publications
- 31 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. PP (00985589) , 1-16
Evolutionary generation of test suites for multi-path coverage of MPI programs with non-determinism
When a large number of target paths in a sequential program need to be covered, we can divide similar target paths into the same group, and generate a test suite covering the same group of target paths at the same time, so as to reduce the testing cost. However, different communication edges may be run under a same test input when executing a Message-Passing I nterface (MPI) program with non-determinism, which cause different code fragments may be traversed, indicating the difficulty of generating a test suite to cover each group of target paths. This paper proposes an approach to evolutionary generation of test suites for multi-path coverage of MPI programs with non-determinism, which can significantly reduce the testing cost and difficulty. We first design an indicator for evaluating each traversal set of communication edges, which is used to form a relation matrix between each target path and each traversal set of communication edges, so as to divide all the target paths into a certain amount of groups. Then, we construct an optimization model for test suite generation associated with each group. Finally, an evolutionary optimization algorithm is extended to solve each model, and used to generate a test suite covering each group of target paths. The proposed approach is utilized and compared with several state-of-the-art approaches to seven benchmark MPI programs, as well as the experimental results illustrate that the proposed approach can efficiently generate a test suite, thus supporting the superiority of the proposed approach.
- 31 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. PP (00985589) , 1-16
Evolutionary generation of test suites for multi-path coverage of MPI programs with non-determinism
When a large number of target paths in a sequential program need to be covered, we can divide similar target paths into the same group, and generate a test suite covering the same group of target paths at the same time, so as to reduce the testing cost. However, different communication edges may be run under a same test input when executing a Message-Passing I nterface (MPI) program with non-determinism, which cause different code fragments may be traversed, indicating the difficulty of generating a test suite to cover each group of target paths. This paper proposes an approach to evolutionary generation of test suites for multi-path coverage of MPI programs with non-determinism, which can significantly reduce the testing cost and difficulty. We first design an indicator for evaluating each traversal set of communication edges, which is used to form a relation matrix between each target path and each traversal set of communication edges, so as to divide all the target paths into a certain amount of groups. Then, we construct an optimization model for test suite generation associated with each group. Finally, an evolutionary optimization algorithm is extended to solve each model, and used to generate a test suite covering each group of target paths. The proposed approach is utilized and compared with several state-of-the-art approaches to seven benchmark MPI programs, as well as the experimental results illustrate that the proposed approach can efficiently generate a test suite, thus supporting the superiority of the proposed approach.
- 7 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 48 (4) , 1169-1184
Orderly Generation of Test Data via Sorting Mutant Branches Based on Their Dominance Degrees for Weak Mutation Testing
Compared with traditional structural test criteria, test data generated based on mutation testing are proved more effective at detecting faults. However, not all test data have the same potence in detecting software faults. If test data are prioritized while generating for mutation testing, the defect detectability of the test suite can be further strengthened. In view of this, we propose a method of test data generation for weak mutation testing via sorting mutant branches based on their dominance degrees. First, the problem of weak mutation testing is transformed into that of covering mutant branches for a transformed program. Then, the dominance relation of mutant branches in the transformed program is analyzed to obtain the non-dominated mutant branches and their dominance degrees. Following that, we prioritize all non-dominated mutant branches in descending order by virtue of their dominance degrees. Finally, the test data are generated in an orderly manner by selecting the mutant branches sequentially. The experimental results on 15 programs show that compared with other methods, the proposed test data generation method can not only improve the error detectability of the test suite, but also has higher efficiency.
- 7 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 48 (4) , 1169-1184
Orderly Generation of Test Data via Sorting Mutant Branches Based on Their Dominance Degrees for Weak Mutation Testing
Compared with traditional structural test criteria, test data generated based on mutation testing are proved more effective at detecting faults. However, not all test data have the same potence in detecting software faults. If test data are prioritized while generating for mutation testing, the defect detectability of the test suite can be further strengthened. In view of this, we propose a method of test data generation for weak mutation testing via sorting mutant branches based on their dominance degrees. First, the problem of weak mutation testing is transformed into that of covering mutant branches for a transformed program. Then, the dominance relation of mutant branches in the transformed program is analyzed to obtain the non-dominated mutant branches and their dominance degrees. Following that, we prioritize all non-dominated mutant branches in descending order by virtue of their dominance degrees. Finally, the test data are generated in an orderly manner by selecting the mutant branches sequentially. The experimental results on 15 programs show that compared with other methods, the proposed test data generation method can not only improve the error detectability of the test suite, but also has higher efficiency.
- Open Access
- 1 January 2017
- Published by Baishideng Publishing Group Inc. in World Chinese Journal of Digestology
- Vol. 25 (12) , 1083
Effect of fast track surgery on clinical efficacy of laparoscopic common bile duct exploration combined with choledochoscopy
探讨加速康复外科(fast track surgery, FTS)理念在腹腔镜联合胆道镜(两镜)胆总管探查取石患者的临床疗效. 45例行两镜下胆总管探查取石患者, 按照随机原则分为传统治疗组(对照组)23例, 加速康复组(观察组)22例, 比较两组患者术后各临床指标、术后生活质量及患者满意度评分的差异. 观察组术后首次下床活动时间、肛门排气时间、夹闭T管时间、住院时间、术后生活质量、患者满意度评分明显优于对照组(PP>0.05). FTS理念用于两镜下胆总管探查取石术患者的围手术期处理不增加术后并发症的发生率, 可加速患者康复, 提高患者术后生活质量和满意度.
- 1 January 2017
- Published by Baishideng Publishing Group Inc. in World Chinese Journal of Digestology
- Vol. 25 (12) , 1083
Open AccessEffect of fast track surgery on clinical efficacy of laparoscopic common bile duct exploration combined with choledochoscopy
探讨加速康复外科(fast track surgery, FTS)理念在腹腔镜联合胆道镜(两镜)胆总管探查取石患者的临床疗效. 45例行两镜下胆总管探查取石患者, 按照随机原则分为传统治疗组(对照组)23例, 加速康复组(观察组)22例, 比较两组患者术后各临床指标、术后生活质量及患者满意度评分的差异. 观察组术后首次下床活动时间、肛门排气时间、夹闭T管时间、住院时间、术后生活质量、患者满意度评分明显优于对照组(PP>0.05). FTS理念用于两镜下胆总管探查取石术患者的围手术期处理不增加术后并发症的发生率, 可加速患者康复, 提高患者术后生活质量和满意度.