Demo Data from VLDB 2026 / reviewers in the wild / expert
Yubin Hu 0003
dblp:266/8226-3
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—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 |
Program analysis · 100% | |
| Network and information security
1 paper |
Systems and software security · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis › symbolic execution
path exploration |
0.7 | 1 | 2023 | Eunomia: Enabling User-Specified Fine-Grained Search in Symbolically Executing WebAssembly Binaries · ISSTA 2023 |
Program analysis
symbolic execution |
0.7 | 1 | 2023 | Eunomia: Enabling User-Specified Fine-Grained Search in Symbolically Executing WebAssembly Binaries · ISSTA 2023 |
Systems and software security
vulnerability discovery |
0.2 | 1 | 2023 | Eunomia: Enabling User-Specified Fine-Grained Search in Symbolically Executing WebAssembly Binaries · ISSTA 2023 |
Methods — techniques the papers use, named apart from their topics
local search strategy · 1.3domain-specific language · 1.3constraint solving · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Eunomia: Enabling User-Specified Fine-Grained Search in Symbolically Executing WebAssembly BinariesabstractAlthough existing techniques have proposed automated approaches to alleviate the path explosion problem of symbolic execution, users still need to optimize symbolic execution by applying various searching strategies carefully. As existing approaches mainly support only coarse-grained global searching strategies, they cannot efficiently traverse through complex code structures. In this paper, we propose Eunomia, a symbolic execution technique that supports fine-grained search with local domain knowledge. Eunomia uses Aes, a DSL that lets users specify local searching strategies for different parts of the program. Eunomia also isolates the context of variables for different local searching strategies, avoiding conflicts. We implement Eunomia for WebAssembly, which can analyze applications written in various languages. Eunomia is the first symbolic execution engine that supports the full features of WebAssembly. We evaluate Eunomia with a microbenchmark suite and six real-world applications. Our evaluation shows that Eunomia improves bug detection by up to three orders of magnitude. We also conduct a user study that shows the benefits of using Aes. Moreover, Eunomia verifies six known bugs and detects two new zero-day bugs in Collections-C. Ningyu He, Zhehao Zhao, Yubin Hu 0003, Shengjian Guo, Haoyu Wang 0001, Guangtai Liang, Ding Li 0001, Xiangqun Chen, Yao Guo 0001 |
ISSTA | 4 |