中文

KoAT: Automatic Complexity and Termination Analysis of Integer Programs

计算机科学中的逻辑 2026-06-26 v1 编程语言
作者: Nils Lommen , Éléanore Meyer , Jürgen Giesl
在 arXiv 上查看 ↗ PDF ↗

摘要

KoAT is a tool to automatically infer complexity bounds and prove termination of (possibly recursive) integer programs. To this end, KoAT implements an alternating modular inference of upper runtime and size bounds for program parts. In particular, KoAT uses a portfolio of different techniques to analyze subprograms. The power of our approach is demonstrated by an extensive experimental evaluation.

引用

@article{arxiv.2606.28542,
  title  = {KoAT: Automatic Complexity and Termination Analysis of Integer Programs},
  author = {Nils Lommen and Éléanore Meyer and Jürgen Giesl},
  journal= {arXiv preprint arXiv:2606.28542},
  year   = {2026}
}

备注

CAV'26