MoAT reduces LTL model checking of infinite state systems to fair termination via automata-based approach and calls KoAT/LoAT, matching state-of-the-art performance in experiments.
Targeting Completeness: Automated Complexity Analysis of Integer Programs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Verifying LTL for Infinite State Systems via Termination Analysis
MoAT reduces LTL model checking of infinite state systems to fair termination via automata-based approach and calls KoAT/LoAT, matching state-of-the-art performance in experiments.
-
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.