## NLCertify: a tool for formal nonlinear optimization.

See the dedicated webpage.

NLCertify is a software package for handling formal certification of nonlinear inequalities involving transcendental multivariate functions. The tool exploits sparse semialgebraic optimization techniques with approximation methods for transcendental functions, as well as formal features. Given a box K and a function f as input, NLCertify provides OCaml libraries that produce nonnegativity certificates for f over K, which can be ultimately proved correct inside the Coq proof assistant. One specific challenge of the field of formal nonlinear reasoning is to develop adaptive techniques to produce certificates with a reduced complexity.

The software first builds the abstract syntax tree t of f. The leaves of t are semialgebraic functions obtained by composition of polynomials with some basic operations (including the square root, sup, inf, +, x, -, /, etc). The other nodes can be either univariate transcendental functions (arctan, cos, exp, etc) or basic operations. NLCertify approximates t with means of semialgebraic estimators and provides lower and upper bounds of t over K. When t represents a polynomial, the tool computes lower and upper bounds of t using a hierarchy of semidefinite (SDP) relaxations, via an interface with the external SDPA solver. The extension to the semialgebraic case is straightforward through the implementation of the Lasserre-Putinar lifting-strategy. The user can choose to approximate transcendental functions with best uniform (or minimax) polynomials as well as maxplus estimators. Univariate minimax polynomials are provided using an interface with the Sollya environment, in which an iterative algorithm designed by Remez is implemented. Alternatively, the maxplus approach builds lower (resp. upper) estimators using concave maxima (resp. convex infima) of quadratic forms. In this way, NLCertify computes certified global estimators from approximations of primitive functions by induction over the syntax tree t.

These various approximation and optimization algorithms are placed in a unified framework extending to about 15000 lines of OCaml code and 3600 lines of Coq code. The NLCertify package solves successfully non-trivial inequalities from the Flyspeck project (essentially tight inequalities, involving both semialgebraic and transcendental expressions of 6~12 variables) as well as significant global optimization benchmarks.

## ParetoImageSDP: approximations of Pareto curves and images of semialgebraic sets.

See the dedicated webpage.

ParetoImageSDP is a set of libraries using the Yalmip and Gloptipoly toolboxes for MATLAB. It provides functions to compute semidefinite approximations of:

1) Pareto curves implementing the three methods described in: Victor Magron, Didier Henrion and Jean-Bernard Lasserre "Approximating Pareto curves using semidefinite relaxations" (on the arxiv).

2) Images of semialgebraic sets under polynomial applications implementing the two methods described in Victor Magron, Didier Henrion and Jean-Bernard Lasserre "Semidefinite approximations of projections and polynomial images of semialgebraic sets" (on Optimization Online).

## ProgCertSOS: certified program analysis using sum-of-squares (SOS) programming.

See the dedicated webpage.

ProgCertSOS is a tool to check whether a given property holds for the values taken by the variables of a program. The tool uses abstract template domains.
ProgCertSOS takes as input one-loop programs with conditional branches, nondeterministic initial values and a given property $\kappa$ to show. A simple example is the following program:

while true
if $r(x) \geq 0$
$x = T_1(x)$;
else
$x = T_2(x)$;
end
end

with the property $\kappa = 1 - \|x\|^2$ (all reachable values lie in the unit sphere).

This tool implements SOS-based techniques described in the article "Property-based Polynomial Invariant Generation using Sums-of-Squares Optimization" hal-01134816.

## Real2Float: A tool for Certified Roundoff Error Bounds using SDP.

See the dedicated webpage.

Real2Float is a set of libraries to analyze floating-point errors of nonlinear programs with semidefinite programming. The tool requires OCaml, SDPA and Coq (optional).

## FPSDP: A tool for Certified Lower Bounds of Roundoff Errors using SDP.

See the dedicated webpage.

FPSDP is a Matlab toolbox to compute lower bounds of floating-point errors for polynomial programs with semidefinite programming. The tool requires Yalmip and Mosek.

## FPBern: A tool for Certified Roundoff Error Bounds using Bernstein Expansions.

See the dedicated webpage.

FPBern is a set of C++/Matlab libraries to analyze floating-point errors of polynomial programs using Bernstein expansions. The C++ module requires GiNaC, GLPK and Boost and the Matlab module requires Matlab Symbolic Toolbox.

## FPKriSten: A tool for Certified Roundoff Error Bounds using Sparse Krivine-Stengle Representations.

See the dedicated webpage.

FPKriSten is a set of Matlab libraries to analyze floating-point errors of polynomial programs with linear programming. The tool requires CPLEX and Yalmip.

## univsos: A tool for Rational Sums of Squares Decompositions of Univariate Nonnegative Polynomials.

See the dedicated webpage.

univsos is a Maple library for computation of sums of squares (SOS) decompositions of univariate nonnegative polynomials with rational coefficients. The library includes two distinct algorithms:
• univsos1, which relies on root isolation, quadratic under approximations of positive polynomials and square-free decomposition.
• univsos2, which relies on root isolation of perturbed positive polynomials and square-free decomposition. This algorithm requires PARI/GP.
• univsos3, which relies on sums of squares approximation (via semidefinite programming) of perturbed positive polynomials and square-free decomposition. This algorithm requires SDPA and SDPA-GMP.

## multivsos: A tool for Rational Sums of Squares Decompositions of Multivariate Nonnegative Polynomials.

See the dedicated webpage.

multivsos is a Maple library for computation of sums of squares (SOS) decompositions of multivariate nonnegative polynomials with rational coefficients in the (un)-constrained case. The library requires convex, SDPA and SDPA-GMP.

In the unconstrained case, multivsos implements a hybrid numeric-symbolic algorithm computing exact rational SOS decompositions for polynomials lying in the interior of the SOS cone. It computes an approximate SOS decomposition for a perturbation of the input polynomial with an arbitrary-precision semidefinite programming (SDP) solver. An exact SOS decomposition is obtained thanks to the perturbation terms.

In the constrained case, multivsos allows to compute weighted SOS decompositions for polynomials positive over basic compact semialgebraic sets.

## biosdp: A tool implementing occupation measure methods for modelling and analysis of biological hybrid automata.

See the dedicated webpage.

biosdp is a set of libraries to model and analyze biological hybrid automata. This tool requires Matlab.