paperbot · PL 论文追踪

全部论文 待读 收藏

P2 EREQ: Regular Expressions with Quantifiers and Incremental Quantifier Elimination

EREQ:带量词的正则表达式与增量式量词消去
PLDI 10(PLDI)2026匹配度 3/10 · 该论文属于逻辑与自动机/判定过程方向,用符号导数替代自动机确定化来判定 wMSO,既未涉及 LLM/Agent,也与浮点程序分析、贝叶斯程序分析无直接关联,不在用户任何一条主线上。仅因含有 Lean 形式化证明 + Rust 工程实现 + 基准评测这一'理论+工程'风格与用户偏好部分吻合,故给出较低的边缘相关分。引用 0 inbox
Ekaterina Zhuchko, Ian Erik Varatalu, Margus Veanes, Nikolaj Bjørner
crossref: 2026-09-10

AI 速览

一句话:提出带量词正则表达式 EREQ,以符号导数做增量式量词消去,替代自动机确定化并高效判定 wMSO。

弱一元二阶逻辑(wMSO)是刻画正则性质的基础工具,其传统判定过程将公式翻译为有限自动机,虽可判定但最坏情形复杂度为非初等;近三十年前的 MONA 表明,经过精心优化的自动机构造在实践中仍可高效判定该逻辑。本文从代数视角重新审视 wMSO,提出带量词的正则表达式 EREQ,不再依赖自动机确定化,而是以符号导数为核心做增量式量词消去,从而给出一种组合式、符号化的替代方案。作者给出了 wMSO 到 EREQ 的线性时间翻译以及 EREQ 上基于导数的判定过程,并在 Lean 证明助手中机器化验证了翻译与导数构造的正确性。最后用 Rust 实现该方案,在 MONA 的经典基准集上评估,性能与当前最先进工具相当,显示了基于导数的方法在高效判定过程中的潜力。

问题
wMSO 的经典判定过程依赖向有限自动机的翻译与确定化,最坏情形复杂度为非初等,如何在避免自动机确定化的前提下高效判定该逻辑是本文要解决的问题。
方法
引入带量词的正则表达式 EREQ,用符号导数实现增量式量词消去,给出 wMSO 到 EREQ 的线性时间翻译,并在 Lean 中机器化证明翻译与导数构造的正确性。
评估
用 Rust 实现该判定过程,在 MONA 的既有基准集上与当前最先进工具对比,显示出具有竞争力的性能。
原文摘要(Abstract)

Weak monadic second-order logic (wMSO) is a foundational tool for specifying regular properties. Traditional decision procedures for this logic typically translate wMSO formulas into finite automata. Although the logic is decidable, this approach incurs non-elementary complexity in the worst-case. Nearly thirty years ago, the state-of-the-art MONA tool showed that, despite these theoretical limits, wMSO can be decided efficiently in practice through carefully optimized automata constructions. We revisit wMSO from an algebraic perspective by introducing Extended Regular Expressions with Quantifiers (EREQ). Instead of relying on automata determinization, EREQ employs symbolic derivatives to perform incremental quantifier elimination, providing a compositional and symbolic alternative to classical automata-based approaches. We present a linear-time translation of wMSO into EREQ and a derivative-based decision procedure for EREQ. We prove the correctness of the translation and of the derivative construction in the Lean proof assistant. We implement our approach in Rust and evaluate it on a set of established MONA benchmarks, demonstrating competitive performance with state-of-the-art tools. Our results demonstrate the potential of derivative-based methods, opening new avenues for efficient decision procedures in EREQ.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot3755,
  title = {EREQ: Regular Expressions with Quantifiers and Incremental Quantifier Elimination},
  author = {Ekaterina Zhuchko and Ian Erik Varatalu and Margus Veanes and Nikolaj Bjørner},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {10},
  number = {PLDI},
  year = {2026},
  doi = {10.1145/3808349}
}