Kovacs, Laura2010-11-302010-11-302010-11-30200810.1007/978-3-540-71070-7_22https://infoscience.epfl.ch/handle/20.500.14299/61056WOS:000258887400022We describe the new software package Aligator for automatically inferring polynomial loop invariants, The package combines algorithms from symbolic summation and polynomial algebra with computational logic, and is applicable to the rich class of P-solvable loops. Aligator contains routines for checking the P-solvability of loops, transforming them into a system of recurrence equations, solving recurrences and deriving closed forms of loop variables, computing the ideal of polynomial invariants by variable elimination, invariant filtering and completeness check of the resulting set of invariants.IdentitiesAlgorithmLoopstext::conference output::conference proceedings::conference paper