This is the KoAT2 Web Interface for the paper "Targeting Completeness: Automated Complexity Analysis of Integer Programs ".

Analysis of Integer Programs

Show Help for CINT Language (in new window)
Note that in the green header, our web interface only outputs bounds in the TermComp format (i.e., here it cannot display polynomial-logarithmic bounds).
For more precise bounds, please refer to the "All Bounds" section at the end of the generated proof.

Accepted file formats: koat

Version koat2-twn-journal