2 citations · 3 across the 9 of their papers we have counts for
6 papers · 1 filter
Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries
Peisen Yao
Interprocedural dominance asks which program points every matched call-and-return execution must pass on its way to a target. An analysis that writes out immediate dominance pays f…
Sharp Two-Round Adaptivity and Round Hierarchies for Semantic Regular Expressions
Runzhou Li, Hongfei Fu, Qingkai Shi +1
Semantic regular expressions (SemREs) attach external Boolean predicates to matched spans, making both the number and the sequentiality of oracle calls central resources. For a fix…
Analyzing the Analyzers: Model Counting Meets Abstract Interpretation
Junda Zheng, Peisen Yao
Abstract interpretation offers a principled foundation for static analysis by approximating concrete program semantics via abstract domains. However, quantitatively comparing the p…
Shared-Context Batched Satisfiability
Jiening Siow, Hanrui Zuo, Hanyun Jiang +2
Program analyzers often issue batches of SMT queries that share a large symbolic context and differ only in a small predicate. We formalize this recurring pattern as \emph{Shared-C…
Learning Splitting Heuristics for Parallel String Solvers
Chenhao Gao, Peisen Yao
String constraint solvers are crucial for reasoning about string-manipulating programs. However, many practical string constraints are undecidable, and real-world applications ofte…
Phoenix: A Modular and Versatile Framework for C/C++ Pointer Analysis
Peisen Yao, Zinan Gu, Qingkai Shi
We present Phoenix, a modular pointer analysis framework for C/C++ that unifies multiple alias analysis algorithms behind a single, stable interface. Phoenix addresses the fragment…