Revisiting the abstract domain of polyhedra : constraints-only representation and formal proof

Abstract : The work reported in this thesis revisits in two waysthe abstract domain of polyhedraused for static analysis of programs.First, strong guarantees are provided on the soundness of the operationson polyhedra,by using of the Coq proof assistant to check the soundness proofs.The means used to ensure correctnessdon't hinder the performance of the resultingVerimag Polyhedra Library (VPL).It is built on the principle of result verification:computations are performed by an untrusted oracleand their results are verified by a checkerwhose correctness is proved in Coq.In order to make verification cheap,the oracle computes soundness witnesses along with the results.The other distinguishing feature of VPL is thatit relies only on the constraint representation of polyhedra,as opposed to the common practice of using both constraints and generators.Despite this unusual choice,VPL turns out to be a competitive abstract domain of polyhedra,performance-wise.As expected, the join operator of VPL,which performs the convex hull of two polyhedra,is the costliest operator.Since it builds on the projection operator,this thesis also investigates a new approach toperforming projections,based on parametric linear programming.A new understanding of projection encoded asa parametric linear problem is presented.The thesis closes on a progress report in the design of a new solvingalgorithm,tailored to the specifics of the encodingso as to achieve good performance.
Complete list of metadatas

Cited literature [45 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01286086
Contributor : Abes Star <>
Submitted on : Thursday, March 10, 2016 - 11:41:07 AM
Last modification on : Friday, July 6, 2018 - 10:08:02 AM
Long-term archiving on : Monday, June 13, 2016 - 9:42:31 AM

File

FOUILHE_2015_archivage.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01286086, version 1

Collections

Citation

Alexis Fouilhé. Revisiting the abstract domain of polyhedra : constraints-only representation and formal proof. Computational Geometry [cs.CG]. Université Grenoble Alpes, 2015. English. ⟨NNT : 2015GREAM045⟩. ⟨tel-01286086⟩

Share

Metrics

Record views

350

Files downloads

387