Publication

Aligator: A mathematica package for invariant generation

2008
Conference Papers

Abstract

We 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.

Official source

https://infoscience.epfl.ch/entities/publication/4c5294c0-837f-4cfe-bde1-7486e3fc4435

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2008
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/4c5294c0-837f-4cfe-bde1-7486e3fc4435

About this result

Related concepts (32)

Invariant theory

Invariant theory is a branch of abstract algebra dealing with actions of groups on algebraic varieties, such as vector spaces, from the point of view of their effect on functions. Classically, the theory dealt with the question of explicit description of polynomial functions that do not change, or are invariant, under the transformations from a given linear group. For example, if we consider the action of the special linear group SLn on the space of n by n matrices by left multiplication, then the determinant is an invariant of this action because the determinant of A X equals the determinant of X, when A is in SLn.

Knot invariant

In the mathematical field of knot theory, a knot invariant is a quantity (in a broad sense) defined for each knot which is the same for equivalent knots. The equivalence is often given by ambient isotopy but can be given by homeomorphism. Some invariants are indeed numbers (algebraic), but invariants can range from the simple, such as a yes/no answer, to those as complex as a homology theory (for example, "a knot invariant is a rule that assigns to any knot K a quantity φ(K) such that if K and are equivalent then φ(K) = φ().

Quantum invariant

In the mathematical field of knot theory, a quantum knot invariant or quantum invariant of a knot or link is a linear sum of colored Jones polynomial of surgery presentations of the knot complement. Finite type invariant Kontsevich invariant Kashaev's invariant Witten–Reshetikhin–Turaev invariant (Chern–Simons) Invariant differential operator Rozansky–Witten invariant Vassiliev knot invariant Dehn invariant LMO invariant Turaev–Viro invariant Dijkgraaf–Witten invariant Reshetikhin–Turaev invariant Tau-inva

Related publications (32)

Aligator: A mathematica package for invariant generation

Chat with Graph Search

Hitting with Probability One for Stochastic Heat Equations with Additive Noise

Dynamical system approach to navigation around obstacles

Succinct ordering and aggregation constraints in algebraic array theories