Random unit-test generation with MUT-aware sequence recommendation. - Wujie Zheng; Qirun Zhang; Michael R. Lyu; Tao Xie 001 (ASE, 2010)

Flow-Augmented Call Graph: A New Foundation for Taming API Complexity. - Qirun Zhang; Wujie Zheng; Michael R. Lyu (FASE, 2011)

Cross-library API recommendation using web search engines. - Wujie Zheng; Qirun Zhang; Michael R. Lyu (SIGSOFT FSE, 2011)

Fast algorithms for Dyck-CFL-reachability with applications to alias analysis. - Qirun Zhang; Michael R. Lyu; Hao Yuan; Zhendong Su 001 (PLDI, 2013)

Scaling CFL-reachability-based alias analysis: theory and practice. - Qirun Zhang (2013)

Efficient subcubic alias analysis for C. - Qirun Zhang; Xiao Xiao 003; Charles Zhang 001; Hao Yuan; Zhendong Su 001 (OOPSLA, 2014)

Persistent pointer information. - Xiao Xiao 003; Qirun Zhang; Jinguo Zhou; Charles Zhang 001 (PLDI, 2014)

Toward understanding compiler bugs in GCC and LLVM. - Chengnian Sun; Vu Le 002; Qirun Zhang; Zhendong Su 001 (ISSTA, 2016)

Skeletal program enumeration for rigorous compiler testing. - Qirun Zhang; Chengnian Sun; Zhendong Su 001 (PLDI, 2017)

Context-sensitive data-dependence analysis via linear conjunctive language reachability. - Qirun Zhang; Zhendong Su 001 (POPL, 2017)

Perses: syntax-guided program reduction. - Chengnian Sun; Yuanbo Li; Qirun Zhang; Tianxiao Gu; Zhendong Su 001 (ICSE, 2018)

Calling-to-reference context translation via constraint-guided CFL-reachability. - Cheng Cai; Qirun Zhang; Zhiqiang Zuo 002; Khanh Nguyen 001; Guoqing Harry Xu; Zhendong Su 001 (PLDI, 2018)

Practical GUI testing of Android applications via model abstraction and refinement. - Tianxiao Gu; Chengnian Sun; Xiaoxing Ma; Chun Cao; Chang Xu 001; Yuan Yao 001; Qirun Zhang; Jian Lu 001; Zhendong Su 001 (ICSE, 2019)

Program debloating via stochastic optimization. - Qi Xin; Myeongsoo Kim; Qirun Zhang; Alessandro Orso (ICSE (NIER), 2020)

Subdomain-Based Generality-Aware Debloating. - Qi Xin; Myeongsoo Kim; Qirun Zhang; Alessandro Orso (ASE, 2020)

Debug information validation for optimized code. - Yuanbo Li; Shuo Ding; Qirun Zhang; Davide Italiano (PLDI, 2020)

Conditional Lower Bound for Inclusion-Based Points-to Analysis. - Qirun Zhang (CoRR, 2020)

On the complexity of bidirected interleaved Dyck-reachability. - Yuanbo Li; Qirun Zhang; Thomas W. Reps (Proc. ACM Program. Lang., 2021)

Static Inference Meets Deep learning: A Hybrid Type Inference Approach for Python. - Yun Peng 003; Cuiyun Gao 001; Zongjie Li; Bowei Gao; David Lo 001; Qirun Zhang; Michael R. Lyu (ICSE, 2022)

Studying and Understanding the Tradeoffs Between Generality and Reduction in Software Debloating. - Qi Xin; Qirun Zhang; Alessandro Orso (ASE, 2022)

Taming transitive redundancy for context-free language reachability. - Yuxiang Lei; Yulei Sui; Shuo Ding; Qirun Zhang (Proc. ACM Program. Lang., 2022)

Efficient algorithms for dynamic bidirected Dyck-reachability. - Yuanbo Li; Kris Satya; Qirun Zhang (Proc. ACM Program. Lang., 2022)

Fast Graph Simplification for Interleaved-Dyck Reachability. - Yuanbo Li; Qirun Zhang; Thomas W. Reps (ACM Trans. Program. Lang. Syst., 2022)

Mutual Refinements of Context-Free Language Reachability. - Shuo Ding; Qirun Zhang (SAS, 2023)

Speeding up SMT Solving via Compiler Optimization. - Benjamin Mikek; Qirun Zhang (ESEC/SIGSOFT FSE, 2023)

Recursive State Machine Guided Graph Folding for Context-Free Language Reachability. - Yuxiang Lei; Yulei Sui; Shin Hwei Tan; Qirun Zhang (Proc. ACM Program. Lang., 2023)

Witnessability of Undecidable Problems. - Shuo Ding; Qirun Zhang (Proc. ACM Program. Lang., 2023)

Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming. - Yuanbo Li; Qirun Zhang; Thomas W. Reps (Proc. ACM Program. Lang., 2023)

The Normalization Barrier Revisited. - Shuo Ding; Qirun Zhang (JENSFEST, 2024)

A Note on Dynamic Bidirected Dyck-Reachability with Cycles. - Qirun Zhang (CoRR, 2024)

Context-Free Language Reachability via Skewed Tabulation. - Yuxiang Lei; Camille Bossut; Yulei Sui; Qirun Zhang (Proc. ACM Program. Lang., 2024)

SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories. - Benjamin Mikek; Qirun Zhang (Proc. ACM Program. Lang., 2024)

Cryptonite: Scalable Accelerator Design for Cryptographic Primitives and Algorithms. - Karthikeya Sharma Maheswaran; Camille Bossut; Andy Wanna; Qirun Zhang; Cong Hao (ASAP, 2025)

Fast Constraint Synthesis for C++ Function Templates. - Shuo Ding; Qirun Zhang (Proc. ACM Program. Lang., 2025)

Robustifying Debug Information Updates in LLVM via Control-Flow Conformance Analysis. - Shan Huang; Jingjing Liang; Ting Su 001; Qirun Zhang (Proc. ACM Program. Lang., 2025)