Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
This paper proposes a new formalism for layout-driven optimization of datapaths. It is based on preserving an arithmetic bit level representation of the arithmetic circuit portion...
Determining the correspondence of image patches is one of the most important problems in Computer Vision. When the intensity space is variant due to several factors such as the ca...
Abstract. We have formal verified a number of algorithms for evaluating transcendental functions in double-extended precision floating point arithmetic in the Intel
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, A...