Demo Data from EDBT 2026 / reviewers in the wild / expert
Jiacheng Zhong
dblp:162/4512
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0003-3050-7569ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Security and privacy · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.
| Network and information security
1 paper |
Systems and software security · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Systems and software security › vulnerability discovery
prototype pollution |
1.0 | 1 | 2026 | The First Large-Scale Systematic Study of Python Class Pollution Vulnerability · SP 2026 |
Systems and software security
vulnerability discovery |
1.0 | 1 | 2026 | The First Large-Scale Systematic Study of Python Class Pollution Vulnerability · SP 2026 |
Program analysis › static analysis
call graph construction |
0.6 | 1 | 2022 | A practical call graph construction method for Python · ESEC/SIGSOFT FSE 2022 |
Program analysis › static analysis
pointer analysis |
0.2 | 1 | 2022 | A practical call graph construction method for Python · ESEC/SIGSOFT FSE 2022 |
Methods — techniques the papers use, named apart from their topics
systematic study · 1.0pointer analysis · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | The First Large-Scale Systematic Study of Python Class Pollution Vulnerability
Jiacheng Zhong, Jianjia Yu, Muxi Lyu, Zifeng Kang, Yinzhi Cao |
SP | 2 |
| 2025 | BiGuidedPrompt: Dynamic Bidirectional Guided Multimodal Prompt Learning
Jiacheng Zhong, Xinguo Zhang, Bingxue Zhang, Jiasong Wu |
ICIC (21) | 1 |
| 2024 | Efficient Construction of Practical Python Call Graphs with Entity Knowledge BaseabstractCall graphs facilitate various tasks in software engineering. However, for the dynamic language Python, the complex language features and external library dependencies pose enormous challenges for building the call graphs of real projects. Some program analysis techniques used for call graph construction in other languages are impractical for Python. In this paper, we present STAR, a practical technique for the construction of Python static call graphs. We reformulate call graph construction as an entity identification task. STAR leverages inter-module summary and cross-project dependencies to construct a fine-grained entity knowledge base to identify the possible nodes and edges of the call graph in the code, and then construct the call graph. Our evaluation of three benchmarks shows that (1) STAR improves recall in three benchmarks compared to three baseline tools. Especially, STAR improves the recall of reachable nodes and reachable edges compared with the state-of-the-art tool by 11.3% and 9.8%, respectively; (2) STAR achieves comparable performance as three baseline tools in execution time and memory usage and is more efficient in large projects; (3) STAR can be effectively used for the task of detecting vulnerability propagation with real-world cases. We expect our results will attract more exploration of practical methods and improve the application of Python call graphs. Yulu Cao, Lin Chen 0015, Zhifei Chen, Jiacheng Zhong, Xiaowei Zhang 0018, Linzhang Wang |
Int. J. Softw. Eng. Knowl. Eng. | 4 |
| 2022 | A practical call graph construction method for PythonabstractPython has become one of the most popular programming languages today. Call graph is one of the essential data structures for many applications in software engineering. However, the precision and recall rate of the existing Python call graph construction methods are generally not high enough, which affects their use in practice. This paper proposes PyPt, a static call graph construction method for Python based on flow-insensitive context-insensitve pointer analysis, which can deal with some dynamic features, such as the dynamic resolution of attributes, higher-order functions, etc. This paper compares PyPt with the state-of-the-art call graph tool PyCG on a benchmark containing 99 manually constructed programs and six real-world open-source projects. The results show that PyPt is better than PyCG in both soundness and completeness. Jiacheng Zhong |
ESEC/SIGSOFT FSE | 1 |