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

基于Prover9的合金规格自动无界验证

Automatic Unbounded Verification of Alloy Specifications with Prover9

Nuno Macedo, Alcino Cunha

摘要:

Alloy是一种越来越流行的基于关系逻辑的轻量级规约语言。合金模型可以使用现成的SAT求解器在有限范围内自动验证。由于错误的断言通常可以使用小的反例来反驳,因此这种方法对于大多数应用程序都足够了。不幸的是,它有时会导致错误的安全感,并且在关键应用中可能需要更传统的无界证明。自动定理证明器Prover9已经被证明对于证明关系代数的定理特别有效[7],关系代数是关系逻辑片段的无量词(或无点)公理化。在本文中,我们提出了一个翻译从合金规格叉代数(关系代数的扩展,具有相同的表达能力的关系逻辑),使其在Prover9无界验证。这种翻译不仅涵盖了逻辑断言,而且还涵盖了结构方面(即类型声明),并成功地实现和应用于几个例子。

英文摘要:

Alloy is an increasingly popular lightweight specification language based on relational logic. Alloy models can be automatically verified within a bounded scope using off-the-shelf SAT solvers. Since false assertions can usually be disproved using small counter-examples, this approach suffices for most applications. Unfortunately, it can sometimes lead to a false sense of security, and in critical applications a more traditional unbounded proof may be required. The automatic theorem prover Prover9 has been shown to be particularly effective for proving theorems of relation algebras [7], a quantifier-free (or point-free) axiomatization of a fragment of relational logic. In this paper we propose a translation from Alloy specifications to fork algebras (an extension of relation algebras with the same expressive power as relational logic) which enables their unbounded verification in Prover9. This translation covers not only logic assertions, but also the structural aspects (namely type declarations), and was successfully implemented and applied to several examples.

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

↑