Scholarlink

This paper describes a specification methodology for the sound modular verification of termination for programs with dynamically bound methods. The basic idea is to group methods into partially ordered clusters and to give precise termination specifications within each cluster. The paper proposes a general methodology where the grouping is specified manually, and a specialized methodology where the grouping is computed modularly from the call graph and some additional specifications.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Methodology for Modular Termination Verification

  • 章节

  • 发表日期：

    2026年

查看全文
  • K. Rustan M. Leino

摘要

This paper describes a specification methodology for the sound modular verification of termination for programs with dynamically bound methods. The basic idea is to group methods into partially ordered clusters and to give precise termination specifications within each cluster. The paper proposes a general methodology where the grouping is specified manually, and a specialized methodology where the grouping is computed modularly from the call graph and some additional specifications.