Demo Data from EDBT 2026 / reviewers in the wild / expert
Xiaoyue Run
dblp:272/5465
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
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% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Software testing
fuzzing |
0.5 | 1 | 2021 | Graph-based Fuzz Testing for Deep Learning Inference Engines · ICSE 2021 |
Software testing
test coverage |
0.5 | 1 | 2021 | Graph-based Fuzz Testing for Deep Learning Inference Engines · ICSE 2021 |
Methods — techniques the papers use, named apart from their topics
mutation · 0.5monte carlo tree search · 0.5graph-based fuzzing · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Graph-based Fuzz Testing for Deep Learning Inference EnginesabstractWith the wide use of Deep Learning (DL) systems, academy and industry begin to pay attention to their quality. Testing is one of the major methods of quality assurance. However, existing testing techniques focus on the quality of DL models but lacks attention to the core underlying inference engines (i.e., frameworks and libraries). Inspired by the success stories of fuzz testing, we design a graph-based fuzz testing method to improve the quality of DL inference engines. This method is naturally followed by the graph structure of DL models. A novel operator-level coverage criterion based on graph theory is introduced and six different mutations are implemented to generate diversified DL models by exploring combinations of model structures, parameters, and data inputs. The Monte Carlo Tree Search (MCTS) is used to drive DL model generation without a training process. The experimental results show that the MCTS outperforms the random method in boosting operator-level coverage and detecting exceptions. Our method has discovered more than 40 different exceptions in three types of undesired behaviors: model conversion failure, inference failure, output comparison failure. The mutation strategies are useful to generate new valid test inputs, by up to an 8.2% more operator-level coverage on average and 8.6 more exceptions captured. Weisi Luo, Dong Chai, Xiaoyue Run, Chunrong Fang, Zhenyu Chen 0001 |
ICSE | 3 |