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

加权路径序的经证实的高效实现

A Verified Efficient Implementation of the Weighted Path Order

René Thiemann, Elias Wenninger

AI总结:

本文针对 Yamada 的 Weighted Path Order 在 CeTA 中经证实的指数级运行时间函数,开发了一种基于记忆化的多项式时间实现,通过使用数字作为内存键来改进早期 Recursive Path Order 实现的查找效率,并克服了由此引入的验证挑战。

摘要:

Yamada 的 Weighted Path Order 是一种用于证明终止性的强大技术。它也得到了 CeTA 的支持,CeTA 是一个用于检查不可信终止性证明的认证器。更准确地说,CeTA 包含一个经证实的函数,该函数针对两个项计算在给定的 WPO 下其中一个项是否大于另一个项,即 WPO 的所有参数均已固定。该经证实函数的问题在于其最坏情况下的运行时间是指数级的。因此,在本研究中,我们开发了一种基于记忆化的 WPO 多项式时间实现。它还改进了 Recursive Path Order 的早期经证实实现:该 RPO 实现使用完整项作为内存的键,这一设计简化了正确性证明,但存在一些运行时开销。在本研究中,键仅为数字,从而使内存中的查找速度更快。尽管在纸面上看似微不足道,但这一改变为验证任务引入了一些挑战。

英文摘要:

The Weighted Path Order of Yamada is a powerful technique for proving termination. It is also supported by CeTA, a certifier for checking untrusted termination proofs. To be more precise, CeTA contains a verified function that computes for two terms whether one of them is larger than the other for a given WPO, i.e., where all parameters of the WPO have been fixed. The problem of this verified function is its exponential runtime in the worst case. Therefore, in this work we develop a polynomial time implementation of WPO that is based on memoization. It also improves upon an earlier verified implementation of the Recursive Path Order: the RPO-implementation uses full terms as keys for the memory, a design which simplified the soundness proofs, but has some runtime overhead. In this work, keys are just numbers, so that the lookup in the memory is faster. Although trivial on paper, this change introduces some challenges for the verification task.

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

↑