LoAT (Lower bounds Analysis Tool) is a tool to automatically infer lower bounds on the worst-case runtime complexity of integer programs (i.e. integer transition systems).
LoAT has been inspired by KoAT and uses a variation of ranking functions in combination with recurrence solving to prove lower bounds. The tool is based on the recurrence solver PURRS and the SMT solver Z3.
The technique behind LoAT is described in this paper.
More information, a detailed evaluation and a static binary can be found on our website.