output
20072026
most citedThe pitfalls of verifying floating-point computations

211 citations

researchers with a paper here
collaborating institutions
Showing 2009 · math.NAShow all

1 paper · 2 filters

math.NA2009★ 1 cited

Fatal Degeneracy in the Semidefinite Programming Approach to the Decision of Polynomial Inequalities

David Monniaux

In order to verify programs or hybrid systems, one often needs to prove that certain formulas are unsatisfiable. In this paper, we consider conjunctions of polynomial inequalities…