paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Checking δ-Satisfiability of Reals with Integrals

检查含积分的实数的 δ-可满足性
OOPSLA 9(OOPSLA1)2025匹配度 3/10 · 该论文属于形式化验证与约束求解,涉及实数约束和δ-可满足性,但未涉及 LLM/Agent、浮点程序分析或贝叶斯程序分析,与画像中的核心交叉方向关联较弱。它仅泛泛属于程序验证,且不包含 LLM 改进形式化验证的内容。引用 1 inbox
Cody Rivera, Bishnu Bhusal, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
crossref: 2026-09-10

AI 速览

一句话:扩展 δ-决策过程以处理含积分的实数约束,并实现工具 ∫dReal 支持验证与合成。

许多程序合成与验证问题可归约为实数公式的可满足性判定,但这类公式常包含积分约束,现有 δ-决策过程无法直接处理。论文扩展 δ-决策过程框架,加入处理用户指定实函数积分的技术,并在 dReal 之上实现工具 ∫dReal。作者在一组基准上评估该工具,包括验证算法公平性、隐私机制的隐私与效用,以及为隐私机制合成满足目标效用的参数。实验性能表明 ∫dReal 能有效求解这些含积分约束的问题。

问题
如何判定含用户指定实函数积分的实数公式的 δ-可满足性,以支持合成与验证问题。
方法
扩展 δ-决策过程框架,加入积分约束处理技术,并基于 dReal 实现工具 ∫dReal。
评估
在公平性验证、隐私机制隐私/效用验证与参数合成等基准上评估 ∫dReal 的性能。
原文摘要(Abstract)

Many synthesis and verification problems can be reduced to determining the truth of formulas over the real numbers. These formulas often involve constraints with integrals in them. To this end, we extend the framework of δ -decision procedures with techniques for handling integrals of user-specified real functions. We implement this decision procedure in the tool ∫dReal, which is built on top of dReal. We evaluate ∫dReal on a suite of problems that include formulas verifying the fairness of algorithms and the privacy and the utility of privacy mechanisms and formulas that synthesize parameters for the desired utility of privacy mechanisms. The performance of the tool in these experiments demonstrates the effectiveness of ∫dReal.

链接与引用

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

BibTeX
@article{paperbot3158,
  title = {Checking δ-Satisfiability of Reals with Integrals},
  author = {Cody Rivera and Bishnu Bhusal and Rohit Chadha and A. Prasad Sistla and Mahesh Viswanathan},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {9},
  number = {OOPSLA1},
  year = {2025},
  doi = {10.1145/3720446}
}