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.
Improving automatic complexity analysis 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
-
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.