Rewriting is a framework for reasoning about functional programming. The dependency pair criterion is a well-known mechanism to analyze termination of term rewriting systems. Functional specifications with an operational semantics based on evaluation are related, in the rewriting framework, to the innermost reduction relation. This paper presents a PVS formalization of the dependency pair criterion for the innermost reduction relation: a term rewriting system is innermost terminating if and only if it is terminating by the dependency pair criterion. The paper also discusses the application of this criterion to check termination of functional specifications.

中文翻译：

---

形式化最内部终止的依赖对准则

重写是用于推理功能编程的框架。依赖项对准则是一种众所周知的机制，用于分析术语重写系统的终止。在重写框架中，具有基于评估的操作语义的功能规范与最内部的缩小关系相关。本文提出了最内层简化关系的依赖对准则的PVS形式化：当且仅当术语重写系统终止于依赖对准则时，术语重写系统才是最内层终止。本文还讨论了该标准在检查功能规范终止方面的应用。