arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.08258cs.LOcs.PL
收藏

形式化验证且高效的静态分析的语用学,尤其针对形式化验证编译器

Pragmatics of Formally Verified Yet Efficient Static Analysis, in particular for Formally Verified Compilers

David Monniaux

AI总结:

本文针对形式化验证编译器所需的静态分析,探讨其正确性证明与效能平衡的难点、解决方案、设计选择及树/映射/集合形式分析结果的相关权衡。

摘要:

形式化验证编译器与形式化验证静态分析器是解决特定行业难题的方案:这类行业需向监管机构证明其运行的目标代码与源代码完全对应,且满足特定属性。从科技视角看,它们是一项挑战:不仅要证明大量非平凡不变量与算法的正确性,实现方案还必须具备合理的效能,确保工具能在可接受的时间内运行。编译器的诸多优化都依赖静态分析,因此形式化验证编译器必然需要形式化验证的静态分析。本文阐述了与验证式静态分析相关的若干难点、可行解决方案、设计选择与权衡,尤其针对分析结果以某种形式的树、映射或集合表示的场景。

英文摘要:

Formally verified compilers and formally verified static analyzers are a solution to the problem that certain industries face when they have to demonstrate to authorities that the object code they run truly corresponds to its source code and that it satisfies certain properties. From a scientific and technological point of view, they are a challenge: not only a number of nontrivial invariants and algorithms must be proved to be correct, but also the implementation must be reasonably effective so that the tools operate within reasonable time. Many optimizations in compilers rely on static analysis, and thus a formally verified compiler entails formally verified static analyses.In this article, we explain some difficulties, possible solutions, design choices and trade-offs pertaining to verified static analysis, in particular when the solution of the analysis is expressed as some form of tree, map or set.

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

↑