Certification of computations over integer polyhedra

Advisors: David Monniaux, Sylvain Boulmé and/or Michaël Périn

Integer polyhedra are used in several fields of computer science (operation research, optimizing compilation…). Yet algorithms on integer polyhedra are complex, and their implementation may be buggy.

The goal of this internship is to certify results of computations on convex integer polyhedra using formally proved procedures.


Contact | Site Map | Site powered by SPIP 3.1.13 + AHUNTSIC [CC License]

info visites 1693827