Scholarlink

Termination is a fundamental question in the analysis of programs. We survey the status of termination problems for a variety of Turing-complete programming models, extended with constructs for (unbounded) nondeterminism, fairness, and probabilistic choice. We provide both the computability-theoretic classification of the termination problems as well as sound and complete proof systems for proving termination.

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

Sound and Complete Techniques for Reasoning About Termination

  • 章节

  • 发表日期：

    2025年

查看全文
  • Rupak Majumdar,
  • V. R. Sathiyanarayana

摘要

Termination is a fundamental question in the analysis of programs. We survey the status of termination problems for a variety of Turing-complete programming models, extended with constructs for (unbounded) nondeterminism, fairness, and probabilistic choice. We provide both the computability-theoretic classification of the termination problems as well as sound and complete proof systems for proving termination.