This paper aims to provide a better formalism for descibing properties of linked data structures, as well as the intermediate states that arise when such structures are destructively updated. The paper defines a new logic that is suitable for these purposes. We show that l sub r is decidabel, and explain how L sub r relates to two previously defined structure-description formalisms by showing how an arbitrary shape descriptor from each fo these formalisms can be translated into an L sub r formula.
展开▼
机译：本文旨在为描述链接数据结构的属性以及破坏性更新此类结构时出现的中间状态提供更好的形式主义。本文定义了适合这些目的的新逻辑。我们表明l sub r是分贝数，并通过显示如何将这些形式主义中的每一个的任意形状描述符转化为L subr公式，来解释L sub r与两个先前定义的结构描述形式主义之间的关系。
展开▼
