paperbot · PL 论文追踪

全部论文 待读 收藏

P1 Scalable Relational Analysis via Relational Bound Propagation

通过关系界传播实现可扩展的关系分析
ICSE Proceedings of the IEEE/ACM 46th International Conference on Software Engineering2024匹配度 5/10 · 论文提出关系界传播以提升有界模型检查的可扩展性,属于形式验证/静态分析的可扩展性技术,与用户关注的 AI→PL 改进形式化验证有间接关联;但它不涉及 LLM/Agent、浮点程序分析或贝叶斯程序分析,未命中当前核心交叉方向。方法有形式化定义、证明和工具实现,符合理论+工程偏好,可作为背景泛读。引用 1 inbox
Clay Stevens, Hamid Bagheri
crossref: 2026-09-12

AI 速览

一句话:提出关系界传播方法,通过语义规则自动收紧关系逻辑公式的界,提升有界模型检查的可扩展性。

有界形式分析如有界模型检查在处理大规模系统时面临可扩展性挑战,界设置不当严重影响性能。本文提出关系界传播方法,利用关系逻辑公式的语义,通过两组语义规则沿抽象语法树传播关系的界:先向上到高层表达式,再向下到关系,从而减少分析变量数并降低成本。文中给出形式定义并证明,实现工具 Propter 并评估。实验显示,63.58% 的测试规约中主变量数平均减少 30.68%(N=519),分析时间平均减少 49.30%;对大规模真实规约,总分析时间平均减少 68.14%(N=25),额外开销仅 6.14%。

问题
有界形式分析技术在处理大规模真实系统时可扩展性不足,且界设置困难且对性能影响大。
方法
提出关系界传播方法,基于关系逻辑公式的语义定义两组规则,沿抽象语法树向上和向下传播关系的界以自动收紧界。
评估
实现工具 Propter,在 519 个规约上实验,测量主变量数、分析时间等,并与基线比较,证明可减少变量数和分析时间。
原文摘要(Abstract)

Bounded formal analysis techniques (such as bounded model checking) are incredibly powerful tools for today's software engineers. However, such techniques often suffer from scalability challenges when applied to large-scale, real-world systems. It can be very difficult to ensure the bounds are set properly, which can have a profound impact on the performance and scalability of any bounded formal analysis. In this paper, we propose a novel approach---relational bound propagation---which leverages the semantics of the underlying relational logic formula encoded by the specification to automatically tighten the bounds for any relational specification. Our approach applies two sets of semantic rules to propagate the bounds on the relations via the abstract syntax tree of the formula, first upward to higher-level expressions on those relations then downward from those higher-level expressions to the relations. Thus, relational bound propagation can reduce the number of variables examined by the analysis and decrease the cost of performing the analysis. This paper presents formal definitions of these rules, all of which have been rigorously proven. We realize our approach in an accompanying tool, Propter, and present experimental results using Propter that test the efficacy of relational bound propagation to decrease the cost of relational bounded model checking. Our results demonstrate that relational bound propagation reduces the number of primary variables in 63.58% of tested specifications by an average of 30.68% (N=519) and decreases the analysis time for the subject specifications by an average of 49.30%. For large-scale, real-world specifications, Propter was able to reduce total analysis time by an average of 68.14% (N=25) while introducing comparatively little overhead (6.14% baseline analysis time).

链接与引用

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

BibTeX
@inproceedings{paperbot11410,
  title = {Scalable Relational Analysis via Relational Bound Propagation},
  author = {Clay Stevens and Hamid Bagheri},
  booktitle = {ICSE},
  year = {2024},
  doi = {10.1145/3597503.3639171}
}