Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra

  title={Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra},
  author={Alexis Fouilh{\'e} and David Monniaux and Micha{\"e}l P{\'e}rin},
Polyhedra form an established abstract domain for inferring runtime properties of programs using abstract interpretation. Computations on them need to be certified for the whole static analysis results to be trusted. In this work, we look at how far we can get down the road of a posteriori verification to lower the overhead of certification of the abstract domain of polyhedra. We demonstrate methods for making the cost of inclusion certificate generation negligible. From a performance point of… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS


Publications referenced by this paper.
Showing 1-10 of 18 references

Experiments on the feasibility of using a floating-point simplex in an SMT solver

  • David Monniaux
  • Workshop on Practical Aspects of Automated…
  • 2012
1 Excerpt

Similar Papers

Loading similar papers…