arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0811.4720cs.LOcs.SC
收藏

复杂数据结构的自动归纳

Automated Induction for Complex Data Structures

Adel Bouhoula, Florent Jacquemard

摘要:

我们提出了一个自动化的隐式归纳定理证明的公式规格的重写规则的条件和约束。这些约束在构造器项(表示数据值)上进行解释,并且可以用固定的树语言表达语法相等、不相等、排序以及成员关系。支持构造函数项之间的约束等式公理,可以用来指定复杂的数据结构,如集合、排序列表、树、幂列表.我们的程序是基于树文法的约束,一种形式主义,它可以准确地描述给定规范的初始模型(当它是足够完整和终止)。他们被用于在归纳证明第一次作为一个感应计划的子目标的产生在感应步骤,第二次检查有效性和冗余标准减少到一个空的问题,第三次定义和解决成员资格的限制。我们表明,该程序是健全的和反驳完成。它推广了以往的测试集归纳技术,并对文中提出的几个非平凡的例子给出了自然的证明,这些例子很难用相关的归纳过程自动指定和进行。

英文摘要:

We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values), and may express syntactic equality, disequality, ordering and also membership in a fixed tree language. Constrained equational axioms between constructor terms are supported and can be used in order to specify complex data structures like sets, sorted lists, trees, powerlists... Our procedure is based on tree grammars with constraints, a formalism which can describe exactly the initial model of the given specification (when it is sufficiently complete and terminating). They are used in the inductive proofs first as an induction scheme for the generation of subgoals at induction steps, second for checking validity and redundancy criteria by reduction to an emptiness problem, and third for defining and solving membership constraints. We show that the procedure is sound and refutationally complete. It generalizes former test set induction techniques and yields natural proofs for several non-trivial examples presented in the paper, these examples are difficult to specify and carry on automatically with related induction procedures.

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

↑