跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+479新增论文
+361其中 AI 相关
+63已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 13:44各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 17:55 — 2026-11-16 17:55(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 13:44库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,827 已收录论文19,941 AI 相关6,921 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
新论文 · v1arXiv:2611.13250

Using Proof Dependencies to Manage Verification Projects

Lea Salome Brugger, Andrea Keusch, João Pereira, Peter Müller

原文摘要

Verification technology now scales to sizable projects, but techniques for managing such projects fall short. There are no effective ways to assess the progress made so far and to determine which verification tasks to perform next. A key issue is that the successful run of a verification tool provides little indication about what has actually been achieved. The guarantees provided depend on the specifications of the verified code as well as any unverified assumptions made in the proofs, e.g., about the behavior of unverified libraries. Manual inspection of specifications and assumptions to determine progress is error-prone and prohibitively expensive. In this paper, we present automated techniques to assess and guide verification projects. All of these techniques employ an automatic proof dependency analysis that computes, for each proof obligation in a project, the specifications, statements, and assumptions that are needed to prove it. We show that this analysis enables effective proof audits by determining all assumptions a proof depends on. We also use it to determine which statements in a program are constrained by the provided specifications, which indicates how strong a specification is. Based on these two insights, we propose a novel progress metric for verification projects and show how to use it to guide verification projects to maximize progress. We implement our approach in the symbolic execution backend of Viper and lift it to the Go verifier Gobra. Our evaluation on real-world benchmarks, including a verified Internet router, shows that the dependency analysis is sound and sufficiently precise, that our progress metric accurately reflects the state of a verification project over time, and that our guidance outperforms standard bottom-up and top-down verification strategies.

cs.SE