Aligator: A Mathematica Package for Invariant Generation (System Description)
From MaRDI portal
Publication:3541707
DOI10.1007/978-3-540-71070-7_22zbMath1165.68525OpenAlexW1577276830MaRDI QIDQ3541707
Publication date: 27 November 2008
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71070-7_22
Related Items
Algebra-Based Loop Analysis, Symbolic computation in automated program reasoning, Real World Verification, Aligator
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A holonomic systems approach to special functions identities
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Generating all polynomial invariants in simple loops
- Computing the algebraic relations of \(C\)-finite sequences and multisequences
- Decision procedure for indefinite hypergeometric summation
- The synthesis of loop predicates
- Reasoning Algebraically About P-Solvable Loops
