210 search results - page 1 / 42 » Widening Integer Arithmetic |
CC
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. Some codes require computations to use fewer bits of precision than are normal for the target machine. For example, Java requires 32-bit arithmetic even on a 64-bit targe...
CAV
2004
Springer
13 years 10 months ago
2004
Springer
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
CADE
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
CADE
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...