关系代数验证不相交集森林
Relation-Algebraic Verification of Disjoint-Set Forests
AI总结:
本文研究如何利用关系代数验证数组实现的算法正确性,通过关系代数语义解释关联数组的读写操作,并在Isabelle/HOL中形式化证明了不相交集森林的实现正确性。
摘要:
本文研究如何利用关系代数,用于高阶规范和验证,来证明低阶数组实现算法的正确性。我们给出了关联数组读写操作的简单关系代数语义。数组操作无缝集成到支持while程序的计算模型中的赋值中。因此,关系代数可用于验证具有关联数组的程序。我们通过使用按秩合并策略和带路径拆分和路径切割的查找操作,验证了不相交集森林的数组实现的正确性。所有结果均在Isabelle/HOL中形式化证明。本文是[1]的扩展版本。
英文摘要:
This paper studies how to use relation algebras, which are useful for high-level specification and verification, for proving the correctness of lower-level array-based implementations of algorithms. We give a simple relation-algebraic semantics of read and write operations on associative arrays. The array operations seamlessly integrate with assignments in computation models supporting while-programs. As a result, relation algebras can be used for verifying programs with associative arrays. We verify the correctness of an array-based implementation of disjoint-set forests using the union-by-rank strategy and find operations with path compression, path splitting and path halving. All results are formally proved in Isabelle/HOL. This paper is an extended version of [1].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。