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

关系属性的认证验证

Certified Verification of Relational Properties

Lionel Blatter, Nikolai Kosmatov, Virgile Prevosto, Pascale Le Gall

摘要:

使用函数契约来指定函数的行为通常仍然限于单个函数调用的范围。关系属性在单个规范中将多个函数调用链接在一起。它们可以表达给定函数的更高级的属性,例如不干涉性,连续性或单调性。它们还可以将调用与不同的函数相关联,例如,以显示优化的实现与其原始对应物等效。然而,在传统的模块化演绎验证环境中,关系属性不能直接表示和验证。自组合已经被提出来克服这个限制,但它需要复杂的转换和额外的分离假设,为现实生活中的语言与指针。我们提出了一种新的方法,不是基于代码转换,避免了这些缺点。它直接应用验证条件生成器来生成逻辑公式,这些公式必须经过验证以确保给定的关系属性。该方法已经完全形式化,并在Coq证明助手中证明是正确的。

英文摘要:

The use of function contracts to specify the behavior of functions often remains limited to the scope of a single function call. Relational properties link several function calls together within a single specification. They can express more advanced properties of a given function, such as non-interference, continuity, or monotonicity. They can also relate calls to different functions, for instance, to show that an optimized implementation is equivalent to its original counterpart. However, relational properties cannot be expressed and verified directly in the traditional setting of modular deductive verification. Self-composition has been proposed to overcome this limitation, but it requires complex transformations and additional separation hypotheses for real-life languages with pointers. We propose a novel approach that is not based on code transformation and avoids those drawbacks. It directly applies a verification condition generator to produce logical formulas that must be verified to ensure a given relational property. The approach has been fully formalized and proved sound in the Coq proof assistant.

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

↑