3 papers
cs.PL2026
A Fresh Look at Best Inductive Loop Invariant Synthesis for Bit-Vector Relations
Hanrui Zuo, Peisen Yao, Kui Ren
Synthesizing best inductive invariants (BII) is fundamental to program analysis and verification, yet existing approaches face significant efficiency challenges. We introduce a new…
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
Synthesizing Best Abstract Transformers via Parallel Bit-Vector Optimization
Weiqi Wang, Peisen Yao, Hanrui Zuo +3
Abstract interpretation provides a principled foundation for constructing sound static analyses through systematic abstraction. A central challenge is synthesizing the best abstrac…