27 search results - page 3 / 6 » Guaranteed Proofs Using Interval Arithmetic |
CADE
2008
Springer
14 years 6 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
SAC
2006
ACM
13 years 6 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
CASC
2009
Springer
14 years 25 days ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
DCC
2006
IEEE
14 years 5 months ago
2006
IEEE
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
ENDM
2010
13 years 6 months ago
2010
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...