Unlike this work, Aligator handles more general loops and uses no abstract interpretation.
Contrarily to this approach, Aligator generates polynomial and quantified invariants without the burden of a priori specified predicates.
The programming model of Aligator is restricted to P-solvable loops (Kovacs, 2008).
First, Aligator translates Figure 1(a) into Figure 1(b) by omitting test conditions.
We tested Aligator on a number of interesting examples coming from academic and open source benchmarks.
Polynomial invariants have been inferred by Aligator in essentially no time, i.
Quantified array invariants have been generated by Aligator on a large number of programs implementing array copies, shifts, initializations, and partitioning.
Aligator first rewrites this loop into Figure 3(b).