KoAT implements alternating modular inference of runtime and size bounds for integer programs using a portfolio of techniques and validates the approach via experimental evaluation.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications , optbooktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 2years
2026 2roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
KoAT implements alternating modular inference of runtime and size bounds for integer programs using a portfolio of techniques and validates the approach via experimental evaluation.
- Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems