14 search results - page 1 / 3 » Fast arithmetic for triangular sets: from theory to practice |
ISSAC
2007
Springer
13 years 10 months ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
STTT
2008
13 years 4 months ago
2008
Abstract. Fast is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under stud...
ISSAC
2007
Springer
13 years 10 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
DATE
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract: This paper addresses the problem of equivalence veriļ¬cation of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have diļ¬...
VMCAI
2007
Springer
13 years 10 months ago
2007
Springer
Interpolation is an important component of recent methods for program veriļ¬cation. It provides a natural and eļ¬ective means for computing separation between the sets of āgood...