Qirun Zhang

Orcid: 0000-0001-5367-9377

Affiliations:
  • Georgia Institute of Technology, School of Computer Science, Atlanta, GA, USA
  • Chinese University of Hong Kong, Hong Kong (PhD 2013)


According to our database1, Qirun Zhang authored at least 31 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories.
Proc. ACM Program. Lang., 2024

Context-Free Language Reachability via Skewed Tabulation.
Proc. ACM Program. Lang., 2024

A Note on Dynamic Bidirected Dyck-Reachability with Cycles.
CoRR, 2024

2023
Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming.
Proc. ACM Program. Lang., January, 2023

Witnessability of Undecidable Problems.
Proc. ACM Program. Lang., January, 2023

Recursive State Machine Guided Graph Folding for Context-Free Language Reachability.
Proc. ACM Program. Lang., 2023

Speeding up SMT Solving via Compiler Optimization.
Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2023

Mutual Refinements of Context-Free Language Reachability.
Proceedings of the Static Analysis - 30th International Symposium, 2023

2022
Fast Graph Simplification for Interleaved-Dyck Reachability.
ACM Trans. Program. Lang. Syst., 2022

Efficient algorithms for dynamic bidirected Dyck-reachability.
Proc. ACM Program. Lang., 2022

Taming transitive redundancy for context-free language reachability.
Proc. ACM Program. Lang., 2022

Studying and Understanding the Tradeoffs Between Generality and Reduction in Software Debloating.
Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering, 2022

Static Inference Meets Deep learning: A Hybrid Type Inference Approach for Python.
Proceedings of the 44th IEEE/ACM 44th International Conference on Software Engineering, 2022

2021
On the complexity of bidirected interleaved Dyck-reachability.
Proc. ACM Program. Lang., 2021

2020
Conditional Lower Bound for Inclusion-Based Points-to Analysis.
CoRR, 2020

Debug information validation for optimized code.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Subdomain-Based Generality-Aware Debloating.
Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering, 2020

Program debloating via stochastic optimization.
Proceedings of the ICSE-NIER 2020: 42nd International Conference on Software Engineering, New Ideas and Emerging Results, Seoul, South Korea, 27 June, 2020

2019
Practical GUI testing of Android applications via model abstraction and refinement.
Proceedings of the 41st International Conference on Software Engineering, 2019

2018
Calling-to-reference context translation via constraint-guided CFL-reachability.
Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

Perses: syntax-guided program reduction.
Proceedings of the 40th International Conference on Software Engineering, 2018

2017
Context-sensitive data-dependence analysis via linear conjunctive language reachability.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Skeletal program enumeration for rigorous compiler testing.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

2016
Toward understanding compiler bugs in GCC and LLVM.
Proceedings of the 25th International Symposium on Software Testing and Analysis, 2016

2014
Persistent pointer information.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014

Efficient subcubic alias analysis for C.
Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, 2014

2013
Scaling CFL-reachability-based alias analysis: theory and practice.
PhD thesis, 2013

Fast algorithms for Dyck-CFL-reachability with applications to alias analysis.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

2011
Cross-library API recommendation using web search engines.
Proceedings of the SIGSOFT/FSE'11 19th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-19) and ESEC'11: 13th European Software Engineering Conference (ESEC-13), 2011

Flow-Augmented Call Graph: A New Foundation for Taming API Complexity.
Proceedings of the Fundamental Approaches to Software Engineering, 2011

2010
Random unit-test generation with MUT-aware sequence recommendation.
Proceedings of the ASE 2010, 2010


  Loading...