Demo Data from EDBT 2026 / reviewers in the wild / expert
Feiyu Wang 0003
dblp:183/9036-3
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0008-3475-7921ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Software testing · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Software testing
combinatorial testing |
0.7 | 1 | 2023 | An Effective Approach to High Strength Covering Array Generation in Combinatorial Testing · IEEE Trans. Software Eng. 2023 |
Software testing › combinatorial testing
covering array generation |
0.7 | 1 | 2023 | An Effective Approach to High Strength Covering Array Generation in Combinatorial Testing · IEEE Trans. Software Eng. 2023 |
Mathematical optimization
discrete optimization |
0.2 | 1 | 2023 | An Effective Approach to High Strength Covering Array Generation in Combinatorial Testing · IEEE Trans. Software Eng. 2023 |
Mathematical optimization › metaheuristic optimization › swarm intelligence
particle swarm optimization |
0.2 | 1 | 2023 | An Effective Approach to High Strength Covering Array Generation in Combinatorial Testing · IEEE Trans. Software Eng. 2023 |
Methods — techniques the papers use, named apart from their topics
quantum particle swarm optimization · 1.3lamarckian learning · 1.3baldwinian learning · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | An Effective Approach to High Strength Covering Array Generation in Combinatorial TestingabstractCombinatorial testing (CT) is an effective testing method that can detect failures caused by the interaction of parameters of the software under test (SUT). With the increasing complexity of SUT and the parameters involved, the variable strength test suite supporting high strength interaction is challenging in a practical testing scenario. This paper presents a multi-learning-based quantum particle swarm optimization (IQIPSO) for high and variable strength covering array generation (VSCAG). Specifically, a specially designed data structure and several combination location methods are proposed to support and speed up the high-strength VSCAG. Besides, multi-learning strategies, including Lamarckian and Baldwinian learning, are applied to IQIPSO to address the premature convergence leading to a large test suite size. Studies for parameter settings of IQIPSO are presented systematically. The IQIPSO method successfully builds test suites where strength is up to 15 and totally reports 13 new best test suite size records. Extensive experiments demonstrate that IQIPSO tends to outperform most other existing methods. Jiantao Zhou 0002, Feiyu Wang 0003, Kecheng Tang |
IEEE Trans. Software Eng. | 4 |