Difference between revisions of "VPL"

From VERASCO
Jump to navigation Jump to search
(+F#)
Line 6: Line 6:
  
 
It implements the constraint-only algorithms for convex polyhedra found in {{bibv|Fouilhe_et_al_SAS2013}}.
 
It implements the constraint-only algorithms for convex polyhedra found in {{bibv|Fouilhe_et_al_SAS2013}}.
 +
 +
The library (if extracted using an experimental version of Coq; we supply the extracted files) can also be compiled under F# (tried under Mono).
  
 
==Prerequisites==
 
==Prerequisites==

Revision as of 06:34, 17 July 2013

VPL is the {Verasco|VERIMAG} Polyhedra Library.

It consists in :

  • An Objective Caml library, implementing polyhedral operations.
  • A Coq checker and wrappers, which provably check the correctness (at least in one direction) of the polyhedral operations.

It implements the constraint-only algorithms for convex polyhedra found in [Fouilhe_et_al_SAS2013].

The library (if extracted using an experimental version of Coq; we supply the extracted files) can also be compiled under F# (tried under Mono).

Prerequisites

  • A recent version of OCaml with ocamlfind (findlib) and the ZArith library
  • If using the Coq development: Coq 8.4pl1

Distribution

OCaml library

As a convenience, we distribute the OCaml library standalone, without any dependency on Coq developments.