535 search results - page 4 / 107 » Termination of Abstract Reduction Systems |
142
Voted
LPAR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
137
click to vote
ICTAC
2004
Springer
15 years 10 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
151
Voted
RTA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
160
Voted
IACR
2011
14 years 4 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...