arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.10746cs.LO
收藏

具有线性时态规范的程序的最弱前置条件规则

Weakest Precondition Rules for Programs with Linear Temporal Specifications

University of Augsburg(奥格斯堡大学);LMU Munich(慕尼黑大学)

Gidon Ernst

AI总结:

研究如何将软件模块集成中时态逻辑需求考虑进去,针对现有工具不足,提出一种简单通用能集成到现有验证条件生成器的解决方案来处理结构化程序与时态逻辑集成问题。

摘要:

随着当今自动程序验证工具的成熟,复杂功能需求可被形式化和证明。为此,它们依靠验证条件生成来衔接结构化程序和高级规范以及后台使用的自动定理证明器。将软件模块集成到更大系统中可能需要考虑时态逻辑需求,尤其是无限迹上的活性属性。不幸的是,大多数现有工具缺乏对此类时态规范的明确支持。虽有各种解决结构化程序与时态逻辑集成的提议,但在表达能力或自动化方面都有固有局限。本文展示了一种简单通用且能轻松集成到现有验证条件生成器的解决方案。

英文摘要:

With today's mature auto-active program verification tools complex functional requirements can be formalized and proved. To that end, they rely on verification condition generation to bridge between structured programs and high-level specifications and the automated theorem provers used in the background. Integrating software modules into larger systems may necessitate to consider temporal logic requirements, notably liveness properties over infinite traces. Unfortunately, most state-of-the-art tools lack explicit support for such temporal specifications. There are various proposals that address the integration of structured programs and temporal logic, but each comes with some inherent limitation regarding expressiveness or automation. In this paper, we demonstrate a simple but universal solution that can be integrated easily into existing verification condition generators.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑