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.
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 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.