Aligator: A Mathematica Package for Invariant Generation (System Description)

Authors:
Laura Kovács
Affiliations:
EPFL, Switzerland
Venue:
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Year:
2008

Citing 10
Cited 4

A holonomic systems approach to special functions identities

Journal of Computational and Applied Mathematics
A Mathematica version of Zeilberger's algorithm for proving binomial coefficient identities

Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The synthesis of loop predicates

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
The Mathematica Book

The Mathematica Book
Generating all polynomial invariants in simple loops

Journal of Symbolic Computation
Computing the algebraic relations of C-finite sequences and multisequences

Journal of Symbolic Computation
Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal

Journal of Symbolic Computation
Reasoning algebraically about P-solvable loops

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems

Real World Verification

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Invariant and type inference for matrices

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
A complete invariant generation approach for p-solvable loops

PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
A practical loop invariant generation approach based on random testing, constraint solving and verification

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the new software package Aligatorfor 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. Aligatorcontains 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.