arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.0170eess.SYcs.SYmath.OC
收藏

软件系统验证中李雅普诺夫不变量的优化

Optimization of Lyapunov Invariants in Verification of Software Systems

Massachusetts Institute of Technology(麻省理工学院);Georgia Institute of Technology(佐治亚理工学院)

Mardavij Roozbehani, Alexandre Megretski, Eric Feron

AI总结:

提出一种基于控制理论的框架,通过将李雅普诺夫函数和凸优化技术应用于数值软件系统验证,解决安全性和性能规范(如无溢出、无除零、有限时间终止等)的验证问题,核心是构造并优化李雅普诺夫不变量。

摘要:

本文提出了一种用于数值软件系统验证的控制理论框架,并将软件验证视为控制与系统理论的一个重要应用。其思想是将李雅普诺夫函数及相关计算技术从控制系统分析和凸优化转移到各种软件安全性和性能规范的验证中。这些规范包括但不限于无溢出、无除零、有限时间终止、死代码存在以及某些用户指定的断言。该框架的核心是李雅普诺夫不变量。这些不变量是程序变量的适当构造的函数,并在执行轨迹上满足某些类似于李雅普诺夫函数的性质。不变量的搜索可以表述为一个凸优化问题。如果相关的优化问题可行,则结果是对该规范的认证。

英文摘要:

The paper proposes a control-theoretic framework for verification of numerical software systems, and puts forward software verification as an important application of control and systems theory. The idea is to transfer Lyapunov functions and the associated computational techniques from control systems analysis and convex optimization to verification of various software safety and performance specifications. These include but are not limited to absence of overflow, absence of division-by-zero, termination in finite time, presence of dead-code, and certain user-specified assertions. Central to this framework are Lyapunov invariants. These are properly constructed functions of the program variables, and satisfy certain properties-resembling those of Lyapunov functions-along the execution trace. The search for the invariants can be formulated as a convex optimization problem. If the associated optimization problem is feasible, the result is a certificate for the specification.

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

↑