Aligator.jl - A Julia Package for Loop Invariant Generation

08/16/2018
by   Andreas Humenberger, et al.
0

We describe the Aligator.jl software package for automatically generating all polynomial invariants of the rich class of extended P-solvable loops with nested conditionals. Aligator.jl is written in the programming language Julia and is open-source. Aligator.jl transforms program loops into a system of algebraic recurrences and implements techniques from symbolic computation to solve recurrences, derive closed form solutions of loop variables and infer the ideal of polynomial invariants by variable elimination based on Gröbner basis computation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2017

Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences

Analyzing and reasoning about safety properties of software systems beco...
research
10/10/2016

Numerical Implicitization for Macaulay2

We present the Macaulay2 package NumericalImplicitization, which allows ...
research
01/11/2018

Invariant Generation for Multi-Path Loops with Polynomial Assignments

Program analysis requires the generation of program properties expressin...
research
06/02/2023

(Un)Solvable Loop Analysis

Automatically generating invariants, key to computer-aided analysis of p...
research
06/14/2022

Solving Invariant Generation for Unsolvable Loops

Automatically generating invariants, key to computer-aided analysis of p...
research
09/25/2019

CLN2INV: Learning Loop Invariants with Continuous Logic Networks

Program verification offers a framework for ensuring program correctness...
research
06/12/2023

Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments

Many stochastic continuous-state dynamical systems can be modeled as pro...

Please sign up or login with your details

Forgot password? Click here to reset