Qiuping Yi

Qiuping Yi

Auto-generated profile, based on publicly available information

Qiuping Yi

Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 June 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
QYQiuping Yi
Qiuping Yi
YYYifan Yu
Yifan Yu
Guowei YangGuowei Yang
Guowei Yang
Symbolic execution is a powerful technique for bug finding by generating test inputs to systematically explore all feasible paths within a given threshold. However, its practical usage is often limited by the path explosion problem. In this paper, we propose compatible branch coverage driven symbolic execution for efficient bug finding. Our new technique owns a novel path-pruning strategy obtained from program dependency analysis to effectively avoid unnecessary explorations. Specifically, based on a Compatible Branch Set , our technique directs symbolic execution to explore feasible branches while soundly pruning redundant paths that have no new contributions to branch coverage. We have implemented our approach atop KLEE and conducted experiments on a set of programs from Siemens Suite, GNU Coreutils, and other real-world programs. Experimental results show that, compared with the state-of-the-art symbolic execution techniques, our approach always uses significantly less time to reproduce bugs while achieving the same or better branch coverage. On average, our approach got over 45% path reduction and 3x speedup on the GNU Coreutils programs

12 April 2026
Verified
Conference Paper
Open access
LJLiuyang Jiang
Liuyang Jiang
SLShenghan Liu
Shenghan Liu
QYQiuping Yi
Qiuping Yi
HLHongliang Liang
Hongliang Liang
XQXiangxing Qian
Xiangxing Qian
LZLiangXu Zou
LiangXu Zou

22 April 2026 in Journal of Systems and Software
Verified
Journal Article
Closed access
ZLZhuang Li
Zhuang Li
QYQiuping Yi
Qiuping Yi
KXKeyang Xiao
Keyang Xiao
ZJZongcheng Ji
Zongcheng Ji
HLHongliang Liang
Hongliang Liang

29 August 2025 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
HLHongliang Liang
Hongliang Liang
KLKailai Liao
Kailai Liao
GWGuohao Wu
Guohao Wu
QYQiuping Yi
Qiuping Yi
Dynamic binary translation (DBT) serves as a pivotal technique for instruction set simulation, yet encounters critical challenges when handling explicit instruction-level parallelism (ILP) and operational latency inherent in very long instruction word (VLIW) architectures. Existing approaches demonstrate limited capability in handling nonarithmetic operations, particularly branch and memory access instructions. The complexity intensifies when translating software-pipelined loops featuring architecture-specific instructions due to two inherent characteristics: 1) instruction reordering, overlapping, and masking within loop bodies, and 2) absence of explicit conditional branches and loop counter manipulation instructions. This work presents three original strategies for VLIW code translation. First, a strategy constrains the translation block (TB) length to resolve branch instruction challenges. Second, an approach manages store-load dependencies through the strategic postponement of store instruction processing. Third, a novel software-pipelined loop translation methodology ensures correct execution semantics by serializing parallel iterations, generating state-specific TBs, and synchronizing inner and outer loops translations. We implemented these techniques in VEMU and evaluated it against dsplib and Polybench benchmarks. VEMU successfully translates all benchmark programs. Our first strategy does not degrade performances and the second strategy brings 0.2% time overhead. Comparative analysis reveals a speedup ratio between $3.25\times $ and $7\times $ over the Texas Instruments simulator for the same benchmarks, validating the efficacy of the proposed techniques.

30 January 2026 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
QWQianyue Wei
Qianyue Wei
ZZZheng Zhang
Zheng Zhang
QYQiuping Yi
Qiuping Yi
ZJZongcheng Ji
Zongcheng Ji
HLHongliang Liang
Hongliang Liang
Deep learning-based vulnerability detection has made significant strides, surpassing traditional static and dynamic analysis methods. However, existing approaches, including Graph Neural Networks (GNNs) and Transformer-based models, still struggle to fully capture complex code semantics. In this paper, we propose CosFormer, a novel Code Semantic-aware Transformer tailored for vulnerability detection. CosFormer introduces two key components: Code Semantic-aware Embedding, which enhances semantic representation at both the token and line levels, and Spatial Dependency-aware Encoding, which integrates structural dependencies from Control Flow Graphs (CFGs) and Program Dependency Graphs (PDGs) to guide attention toward vulnerability-relevant code. We evaluate CosFormer on four benchmark datasets, including a real-world dataset, and demonstrate its superior performance. CosFormer achieves the highest F1 scores across all tasks, outperforming state-of-the-art GNN-based and Transformer-based models, as well as large language models (LLMs). Notably, CosFormer achieves a Cross F1 of 69.37 and a Mixed F1 of 58.42 in generalization evaluation, surpassing all baselines. These results highlight CosFormer’s effectiveness and robustness in detecting vulnerabilities across diverse and previously unseen codebases.

1 October 2026 in Proceedings of the ACM on Software Engineering
Verified
Journal Article
Open access
PDPengbo Du
Pengbo Du
QYQiuping Yi
Qiuping Yi
LZLiangzheng Zhang
Liangzheng Zhang
HLHongliang Liang
Hongliang Liang
As Android applications grow in scale, latent performance issues increasingly degrade user experience and business outcomes, yet systematically identifying optimization opportunities in large codebases remains challenging. We present OptiMine, a hybrid knowledge-to-code framework that integrates large language models (LLMs) with static program analysis to automatically uncover actionable performance optimizations. OptiMine systematically transforms unstructured expert knowledge from documents, commit diffs, and reports into structured Optimization Signatures, enabling reproducible and context-aware program reasoning. These signatures drive scalable candidate retrieval via declarative Datalog queries, while LLM-guided semantic validation performs precise applicability checking, side-effect analysis, and impact-aware ranking. We evaluate OptiMine on a public benchmark and a large industrial Android codebase. The results show that OptiMine achieves higher precision and broader coverage than heuristic- and pattern-based baselines, while scaling effectively to industrial settings. Overall, OptiMine enables reliable and scalable performance auditing, bridging expert knowledge and actionable performance improvements in real-world mobile systems.