重写归纳中的模板
Templates in Rewriting Induction
AI总结:
本文提出基于模板的重写归纳方法,用于生成归纳假设,以分析实际编程代码,弥补传统方法在处理约束和计算时的不足。
摘要:
重写归纳(RI)是术语重写中用于建立程序等价性的形式系统。最近定义的有界RI用于更高阶逻辑约束术语重写系统(LCSTRSs)提供了分析实际编程代码的便利证明系统。RI中的实际挑战是自动生成归纳假设(称为引理)。虽然存在多种针对纯术语重写的引理生成技术,但考虑计算或约束复杂性的技术却较少。利用最近的更高阶RI发展,本文提出了一种基于模板的新方法,通过识别典型编程构造作为高阶函数的实例。虽然模板曾被用作独立方法来证明程序转换的正确性,但本文考虑将其整合到有界RI中,以获得互补的引理生成启发式方法。这使我们能够证明此前无法证明的等价性。
英文摘要:
Rewriting Induction (RI) is a formal system in term rewriting to establish program equivalence. The recently defined Bounded RI for higher-order Logically Constrained Term Rewriting Systems (LCSTRSs) yields a convenient proof system for analyzing real programming code. A practical challenge in RI is the automatic generation of induction hypotheses, called lemmas. While various lemma generation techniques exist for plain term rewriting, there are much fewer that consider the intricacies brought on by calculations or constraints. Taking advantage of recent developments in higher-order RI, we here present a new approach based on templates, which operates by recognising typical programming constructs as instances of higher-order functions. While templates have been used as a stand-alone method to justify the correctness of program transformations, we here consider their integration in Bounded RI to obtain a complementary lemma generation heuristic. This allows us to prove equivalences that were previously out of reach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。