Skip to content
forked from mpelleau/AbSolute

Constraint solver based on abstract domains

Notifications You must be signed in to change notification settings

ghilesZ/AbSolute

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Simplified/Stable version of AbSolute

AbSolute is a constraint solver based on abstract domains. It implements the solving method presented in: "A Constraint Solver Based on Abstract Domains". This is a simplified version that does not enjoy all the features of the real AbSolute which can be found here.

Solving example:

/* simple example with sinus and cosinus */
init{
  real x = [-10;10];
  real y = [-5;5];
}

constraints{
  y < sin(x) + 1;
  y > cos(x) - 1;
}

You can see other examples of problems in the problem directory

Build

A simple make will do the job.

warning:

For some reason, having both packages libapron and libapron-dev installed will make the building of absolute fail. Therefore, the easiest way to deal with apron is to install it with and only with opam : https://opam.ocaml.org/packages/

Use

./solver.opt problem
options

to display the list of options, type: ./solver.opt -help or ./solver.opt --help

Requirements

Current

AbSolute is currently still in developpement, and have not been tested. Feel free to contact any member of the developpement team if you want to report a bug or suggest a feature

About

Constraint solver based on abstract domains

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • OCaml 97.6%
  • Makefile 2.2%
  • C 0.2%