activity
20212026
most citedVerifying Data Constraint Equivalence in FinTech Systems

2 citations · 3 across the 9 of their papers we have counts for

collaborators
Showing cs.PLShow all

6 papers · 1 filter

cs.PL2026

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…

cs.PL2026

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…

cs.PL2026

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…

cs.PL2023

Synthesizing Conjunctive Queries for Code Search

Chengpeng Wang, Peisen Yao, Wensheng Tang +2

This paper presents Squid, a new conjunctive query synthesis algorithm for searching code with target patterns. Given positive and negative examples along with a natural language d…

cs.PL2023★ 2 cited

Verifying Data Constraint Equivalence in FinTech Systems

Chengpeng Wang, Gang Fan, Peisen Yao +2

Data constraints are widely used in FinTech systems for monitoring data consistency and diagnosing anomalous data manipulations. However, many equivalent data constraints are creat…

cs.PL2021★ 1 cited

Efficient Path-Sensitive Data-Dependence Analysis

Peisen Yao, Jinguo Zhou, Xiao Xiao +3

This paper presents a scalable path- and context-sensitive data-dependence analysis. The key is to address the aliasing-path-explosion problem via a sparse, demand-driven, and fuse…