default search action
Qirun Zhang
Person information
- affiliation: Georgia Institute of Technology, School of Computer Science, Atlanta, GA, USA
- affiliation (PhD 2013): Chinese University of Hong Kong, Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Benjamin Mikek
, Qirun Zhang
SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories. Proc. ACM Program. Lang. 8(PLDI): 246-271 (2024) - [j8]Yuxiang Lei
Context-Free Language Reachability via Skewed Tabulation. Proc. ACM Program. Lang. 8(PLDI): 1830-1853 (2024) - [c21]Shuo Ding
The Normalization Barrier Revisited. JENSFEST 2024: 1-4 - [i3]Qirun Zhang:
A Note on Dynamic Bidirected Dyck-Reachability with Cycles. CoRR abs/2401.03570 (2024) - 2023
- [j7]Yuxiang Lei
Recursive State Machine Guided Graph Folding for Context-Free Language Reachability. Proc. ACM Program. Lang. 7(PLDI): 318-342 (2023) - [j6]Shuo Ding
Witnessability of Undecidable Problems. Proc. ACM Program. Lang. 7(POPL): 982-1002 (2023) - [j5]Yuanbo Li
Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming. Proc. ACM Program. Lang. 7(POPL): 1003-1026 (2023) - [c20]Shuo Ding
Mutual Refinements of Context-Free Language Reachability. SAS 2023: 231-258 - [c19]Benjamin Mikek
Speeding up SMT Solving via Compiler Optimization. ESEC/SIGSOFT FSE 2023: 1177-1189 - 2022
- [j4]Yuxiang Lei
Taming transitive redundancy for context-free language reachability. Proc. ACM Program. Lang. 6(OOPSLA2): 1556-1582 (2022) - [j3]Yuanbo Li, Kris Satya, Qirun Zhang
Efficient algorithms for dynamic bidirected Dyck-reachability. Proc. ACM Program. Lang. 6(POPL): 1-29 (2022) - [j2]Yuanbo Li
Fast Graph Simplification for Interleaved-Dyck Reachability. ACM Trans. Program. Lang. Syst. 44(2): 11:1-11:28 (2022) - [c18]Yun Peng, Cuiyun Gao, Zongjie Li, Bowei Gao, David Lo
Static Inference Meets Deep learning: A Hybrid Type Inference Approach for Python. ICSE 2022: 2019-2030 - [c17]Qi Xin, Qirun Zhang
Studying and Understanding the Tradeoffs Between Generality and Reduction in Software Debloating. ASE 2022: 99:1-99:13 - 2021
- [j1]Yuanbo Li, Qirun Zhang
On the complexity of bidirected interleaved Dyck-reachability. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - 2020
- [c16]Qi Xin, Myeongsoo Kim, Qirun Zhang
Program debloating via stochastic optimization. ICSE (NIER) 2020: 65-68 - [c15]Qi Xin, Myeongsoo Kim, Qirun Zhang
Subdomain-Based Generality-Aware Debloating. ASE 2020: 224-236 - [c14]Yuanbo Li, Qirun Zhang
Fast graph simplification for interleaved Dyck-reachability. PLDI 2020: 780-793 - [c13]Yuanbo Li, Shuo Ding, Qirun Zhang
Debug information validation for optimized code. PLDI 2020: 1052-1065 - [i2]Qirun Zhang:
Conditional Lower Bound for Inclusion-Based Points-to Analysis. CoRR abs/2007.05569 (2020)
2010 – 2019
- 2019
- [c12]Tianxiao Gu, Chengnian Sun, Xiaoxing Ma, Chun Cao, Chang Xu, Yuan Yao, Qirun Zhang
Practical GUI testing of Android applications via model abstraction and refinement. ICSE 2019: 269-280 - 2018
- [c11]Chengnian Sun, Yuanbo Li, Qirun Zhang
Perses: syntax-guided program reduction. ICSE 2018: 361-371 - [c10]Cheng Cai, Qirun Zhang
Calling-to-reference context translation via constraint-guided CFL-reachability. PLDI 2018: 196-210 - 2017
- [c9]Qirun Zhang
Skeletal program enumeration for rigorous compiler testing. PLDI 2017: 347-361 - [c8]Qirun Zhang
Context-sensitive data-dependence analysis via linear conjunctive language reachability. POPL 2017: 344-358 - 2016
- [c7]Chengnian Sun, Vu Le, Qirun Zhang
Toward understanding compiler bugs in GCC and LLVM. ISSTA 2016: 294-305 - [i1]Qirun Zhang, Chengnian Sun, Zhendong Su:
Skeletal Program Enumeration for Rigorous Compiler Testing. CoRR abs/1610.03148 (2016) - 2014
- [c6]Qirun Zhang
Efficient subcubic alias analysis for C. OOPSLA 2014: 829-845 - [c5]Xiao Xiao, Qirun Zhang
Persistent pointer information. PLDI 2014: 463-474 - 2013
- [b1]Qirun Zhang:
Scaling CFL-reachability-based alias analysis: theory and practice. Chinese University of Hong Kong, Hong Kong, 2013 - [c4]Qirun Zhang
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis. PLDI 2013: 435-446 - 2011
- [c3]Qirun Zhang
Flow-Augmented Call Graph: A New Foundation for Taming API Complexity. FASE 2011: 386-400 - [c2]Wujie Zheng, Qirun Zhang
Cross-library API recommendation using web search engines. SIGSOFT FSE 2011: 480-483 - 2010
- [c1]Wujie Zheng, Qirun Zhang
Random unit-test generation with MUT-aware sequence recommendation. ASE 2010: 293-296
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: