81 search results - page 1 / 17 » Rewrite Systems for Integer Arithmetic |
CADE
2012
Springer
11 years 9 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...
RTA
1995
Springer
13 years 11 months ago
1995
Springer
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
CC
2005
Springer
13 years 7 months ago
2005
Springer
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...