paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Reducer-based construction of conditional verifiers

基于 reducer 的条件验证器构造
ICSE Proceedings of the 40th International Conference on Software Engineering2018匹配度 3/10 · 该论文属于程序验证/条件模型检测,与形式化验证方向相邻,但未涉及 LLM/Agent 改进验证、浮点程序分析或贝叶斯程序分析,也不是静态分析在 Agentic 程序中的应用,因此与当前核心研究画像匹配度较低。引用 40 inbox
Dirk Beyer, Marie-Christine Jakobs, Thomas Lemberger, Heike Wehrheim
crossref: 2026-09-12

AI 速览

一句话:提出基于 reducer 的构造方法,将现有验证器改造成能够接收并利用条件的条件验证器。

论文关注软件验证中单一验证器难以完成困难任务的问题,主张联合多种采用不同技术的验证器,并通过条件模型检查在验证器之间交换信息:第一个验证器输出一个条件,描述其已成功验证的状态空间,第二个验证器据此只验证尚未验证的部分。然而多数验证器并不支持把条件作为输入。为此,论文提出基于 reducer 的构造方法,用以将现有验证器改造成条件验证器,从而能够理解并利用前序验证器产生的条件。摘要未给出具体实验评估与结果。

问题
软件验证仍很困难,单一验证器难以应对困难任务;条件模型检查虽能让验证器间交换已验证状态空间的信息,但多数验证器无法把条件作为输入。
方法
提出基于 reducer 的构造方法,将现有验证器改造成能够读取并使用条件的条件验证器。
评估
摘要未提供评估细节或实验结果。
原文摘要(Abstract)

Despite recent advances, software verification remains challenging. To solve hard verification tasks, we need to leverage not just one but several different verifiers employing different technologies. To this end, we need to exchange information between verifiers. Conditional model checking was proposed as a solution to exactly this problem: The idea is to let the first verifier output a condition which describes the state space that it successfully verified and to instruct the second verifier to verify the yet unverified state space using this condition. However, most verifiers do not understand conditions as input.

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot4463,
  title = {Reducer-based construction of conditional verifiers},
  author = {Dirk Beyer and Marie-Christine Jakobs and Thomas Lemberger and Heike Wehrheim},
  booktitle = {ICSE},
  year = {2018},
  doi = {10.1145/3180155.3180259}
}